Work

Finding Tours in the TSP

Year: 1999

Type: article

Abstract: The traveling salesman problem, or TSP for short, is easy to state: given a finite number of ''cities'' along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point. The travel costs are symmetric in the sense that traveling from city X to city Y costs just as much as traveling from Y to X; the ''way of visiting all the cities'' is simply the order in which the cities are visited. In this report we consider the relaxed version of the TSP where we ask only for a tour of low cost. This is a preliminary version of a chapter of planned monograph on the TSP

Source: OpenGrey (Institut de l'Information Scientifique et Technique)

Authors: David Applegate, Robert E. Bixby, Vašek Chvátal, William J. Cook

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Office of Naval Research

Award: G8876996369

OpenAlex ID: W1581197757

FWCI: 2.808

Cites:

Cited by: 68

Related to: 10