Back to Results
First PageMeta Content
Travelling salesman problem / NP-complete problems / Approximation algorithms / Operations research / Graph / Nearest neighbour algorithm / Concorde TSP Solver / Hamiltonian path / Optimization problem / Theoretical computer science / Mathematics / Graph theory


Document Date: 2005-01-12 05:25:58

Open Document

File Size: 196,04 KB

Share Result on Facebook

City

Surrey / Houston / /

Company

Lin-Kernighan / SIAM J. Comp / The times / Veritas DGC Ltd. / /

Country

United Kingdom / United States / /

/

Facility

University of London / /

IndustryTerm

local search algorithm / heuristic algorithm / feasible solution / greedy algorithm / travel time / nearest neighbor algorithm / software package / feasible solutions / /

OperatingSystem

XP / /

Organization

Department of Computer Science / University of London / /

Person

R.E. Bixby / V / Helmut Jakubowicz / Larry Scott / Damian Hite / Stacker Crane / Sam Borman / Gregory Gutin / /

Position

Travelling Salesman / Asymmetric Travelling Salesman / SVP / Symmetric Traveling Salesman / Salesman / Solving SVP SVP / Corresponding author / /

ProgrammingLanguage

TSP / /

ProvinceOrState

New York / Texas / /

Technology

local search algorithm / RAM / LinKernighan algorithm / greedy algorithm / nearest neighbor algorithm / /

URL

http /

SocialTag