The travelling salesman and the PQ-tree

Mathematics of Operations Research

Volumn 23, Issue 3, 1998, Pages 613-623

  Burkard, Rainer E ^a   Deǐneko, Vladimir G ^b   Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Combinatorial optimization; Dynamic programming; Euclidean travelling salesman problem; Polynomial algorithm; PQ tree; Travelling salesman problem

Indexed keywords

ALGORITHMS; CALCULATIONS; DYNAMIC PROGRAMMING; POLYNOMIALS; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION; EUCLIDEAN TRAVELLING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 1942521652     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.3.613     Document Type: Article

References (12)

1. Booth, K. S., G. S. Lueker (1976). Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13 335-379.
2. Burkard, R. E., J. A. A. Van der Veen (1991). Universal conditions for algebraic traveling salesman problems to be efficiently solvable. Optimization 22 787-814.
3. Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, Carnegie Mellon University, Pittsburgh.
4. Gilmore, P. C., E. L. Lawler, D. B. Shmoys (1985). Well-solved special cases. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds., The Travelling Salesman Problem. Wiley, Chichester, 87- 143.
5. Held, M., R. M. Karp (1962). A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10 196-210.
6. Johnson, D. S., C. H. Papadimitriou (1985). Performance guarantees for heuristics. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds., The Travelling Salesman Problem. Wiley, Chichester, 145-180.
7. Klyaus, P. S. (1976). The structure of the optimal solution of certain classes of travelling salesman problems (m Russian), Vestst Akad. Navuk Belarusi Ser. Fiz. Mat. Navuk 4 95-98.
8. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys (1985). The Travelling Salesman Problem. Wiley, Chichester.
9. Papadimitriou, C. H. (1977). The Euclidean travelling salesman problem is NP-complete. Theoret. Comput. Sci. 4237-244.
10. _, K. Steiglitz (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, New Jersey.
11. _, U. V. Vazirani (1984). On two geometric problems related to the travelling salesman problem. J. Algorithms 5 231-246.
12. Serdyukov, A. (1978). On some extremal walks in graphs. Upravlyaemye sistemy 17 76-79.