Solvable cases of the traveling salesman problem and heuristics
Conference
·
OSTI ID:35939
It is well known that the traveling salesman problem (TSP) is NP-hard. Still there are special so-called solvable cases that the problem can be solved in polynomial time. The list of papers where the TSP is investigated contains thousands of titles. On the other hand the list of solvable cases is quite short. Still investigations of special cases are interesting from both a theoretical and practical point of view. Interconnections between the well known TSP solvable cases as well as new cases are discussed. Particularly, interconnections between the pyramidal tours, well known double tree algorithm and Held and Karp dynamic programming algorithm for the TSP are clarified.
- OSTI ID:
- 35939
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
The cost-constrained traveling salesman problem
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
A concurrent neural network algorithm for the traveling salesman problem
Technical Report
·
Mon Oct 01 00:00:00 EDT 1990
·
OSTI ID:6223080
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416817
A concurrent neural network algorithm for the traveling salesman problem
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5271931