The travelling salesman and the PQ-tree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 490-504

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

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

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

Indexed keywords

COMBINATORIAL OPTIMIZATION; FORESTRY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

DISTANCE MATRICES; DYNAMIC PROGRAMMING ALGORITHM; EXPONENTIAL NEIGHBORHOOD; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME; PQ-TREE; TRAVELLING SALESMAN; TRAVELLING SALESMAN PROBLEM;

DYNAMIC PROGRAMMING;

EID: 30244496882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_36     Document Type: Conference Paper

References (18)

1. F. Aurenhammer, On-line sorting of twisted sequences in linear time, BIT 28 1988, 194-204.
2. K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences 13, 1976, 335-379.
3. R.E. Burkard and J.A.A. Van der Veen, Universal conditions for algebraic traveling salesman problems to be efficiently solvable, Optimization 22, 1991, 787-814.
4. J. Carlier and P. Villon, A new heuristic for the travelling salesman problem, RAIRO-Operations Research 24, 1990, 245-253.
5. N. Christoftdes, Worst-Case Analysis of a new heuristic for the travelling salesman problem, Technical Report CMU, 1976.
6. G.A. Croes, A method for solving travelling-salesman problems, Operations Research 6, 1958, 791-812.
7. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, Well-solved special cases, Chapter 4 in [12], 87-143.
8. F. Glover and A.P. Punnen, The travelling salesman problem: New solvable cases and linkages with the development of approximation algorithms, Technical report, University of Colorado, Boulder, 1995.
9. M. Held and R.M. Karp, A dynamic programming approach to sequencing problems, J. SIAM 10, 1962, 196-210.
10. D.S. Johnson and C.H. Papadimitriou, Performance guarantees for heuristics, Chapter 5 in [12], 145-180.
11. P.S. Klyaus, The structure of the optimal solution of certain classes of travelling salesman problems, (in Russian), Vestsi Akad. Nauk BSSR, Physics and Math. Sci., Minsk, 1976, 95-98.
12. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, The travelling salesman problem, Wiley, Chichester, 1985.
13. S. Lin, Computer solutions to the travelling salesman problem, Bell System Tech. J. 44, 1965, 2245-2269.
14. C.H. Papadimitriou, The Euclidean travelling salesman problem is NP-complete, Theoretical Computer Science 4, 1977, 237-244.
15. C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization: algorithms and complexity, Prentice Hall, New Jersey, 1982.
16. C.H. Papadimitriou and U.V. Vazirani, On two geometric problems related to the travelling salesman problem, J. Algorithms 5, 1984, 231-246.
17. C.N. Potts and S.L. van de Velde, Dynasearch-Iterative local improvement by dynamic programming: Part I, The travelling salesman problem, Technical Report, University of Twente, The Netherlands, 1995.
18. A. Serdyukov, On some extremal walks in graphs, Upravliaemye systemy 17, Institute of Mathematics of the Siberian Academy of Sciences, USSR, 1978, 76-79.