The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms

Journal of the Operational Research Society

Volumn 48, Issue 5, 1997, Pages 502-510

  Glover, F ^a   Punnen, A P ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Computational complexity; Heuristics; Networks; Travelling salesman problem

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COSTS; HEURISTIC METHODS; OPTIMIZATION;

COMBINATORIAL PROBLEMS; TRAVELLING SALESMAN PROBLEM;

ALGORITHMS;

EID: 0031140372     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600392     Document Type: Article

References (12)

1. Cornuejols G, Naddef GD, Pulleyblank WR (1983). Halin graphs and the travelling salesman problem. Math Program. 26: 287-294.
2. Glover F (1992). Ejection chains, reference structures and alternating path methods for the travelling salesman problem. Graduate School of Business Administration, University of Colorado, Boulder.
3. Gilmore PC, Lawler EL, Shmoys DB (1985). Well solved cases. In: Lawler EL, Lengtra JK, Rinooykan AHG and Shmoys DB (eds). Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. JohnWiley & Sons New York: pp 87-143.
4. Klyaus PS (1976). Structure of the optimal solution of certain classes of travelling salesman problem. Vestsi Akad Navuk BSSR Ser Fiz-Mat Navuk 6: 95-98.
5. Demidenko VM (1979). The travelling salesman problem with asymmetric matrices (in Russian). Vestsi Akad Navuk BSSR Ser Fiz-Mat Navuk 9: 29-35.
6. Baki F (1995). Solvable cases of the travelling salesman problem, MBA Thesis, Faculty of Administration, University of New Brunswick, Canada.
7. Van der Veen JAA (1992). A Solvable cases of the travelling salesman problem with various objective functions. Ph.D thesis, Rijksuniversiteit, Groningen.
8. Dal RV, van der Veen JA A, Sierksma G (1993). Small and large TSP: Two polynomially solvable cases of the travelling salesman problem. Eur J Opns Res 69: 107-120.
9. Burkard RE et al (1995). Well-solvable special cases of the TSP: A survey. Research Report, Technische Universitat Graz.
10. Karp RM, Steele JM (1985). Probabilistic analysis of heuristics. In: Lawler EL, Lenstra JK, Rinooykan AHG and Shmoys DB (eds). Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons New York pp 181-206.
11. Glover F (1995). Tabu thresholding: Improved search by nonmonotonic trajectories trajectories. ORSA J Comp 7, 426-442.
12. Garfinkel RS, Gilbert KC (1978). The bottleneck travelling salesman problem: Algorithms and probabilistic analysis. J Assoc Comp Mach 25: 435-448.