TSP heuristics: Domination analysis and complexity

Algorithmica (New York)

Volumn 35, Issue 2, 2003, Pages 111-127

  Punnen, Abraham ^a   Margot, Francois ^b   Kabadi, Santosh ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Approximation algorithms; Computational complexity; Domination analysis; Traveling salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; ITERATIVE METHODS; POLYNOMIALS; TRAVELING SALESMAN PROBLEM; VECTORS;

APPROXIMATION ALGORITHMS; DOMINATION ANALYSIS;

HEURISTIC METHODS;

EID: 0038170126     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0986-1     Document Type: Article

References (29)

1. Carlier, J., and Villon, P., A New Heuristic for the Traveling Salesman Problem, RAIRO-Operations Research 24 (1990), 245-253.
2. Christofides, N., Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
3. Fischer, S. T., A Note on the Complexity of Local Search Problems, Information Processing Letters 53 (1995), 69-75.
4. Garey, M.R., and Johnson, D. S., Computers and Intractability, a Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
5. Glover, F., Ejection Chains, Reference Structures, and Alternating Path Algorithms for the Traveling Salesman Problem, Research Report, University of Colorado-Boulder, Graduate School of Business, 1992. (A short version appeared in Discrete Applied Mathematics 65 (1996), 223-253.)
6. Glover, F., and Punnen, A.P., The Traveling Salesman Problem: New Solvable Cases and Linkages with the Development of Approximation Algorithms, Journal of the Operational Research Society 48 (1997), 502-510.
7. Grover, L., Local Search and the Local Structure of NP-Complete Problems, Operations Research Letters 12 (1992), 235-243.
8. Gutin, G., and Punnen, A.P. (editors), The Traveling Salesman Problem and its Variations, Kluwer, Boston, MA, 2002.
9. Gutin, G., and Yeo, A., TSP Heuristics with Large Domination Number, TR-12, Department of Mathematics and Statistics, Brunel University 1998.
10. Gutin, G., and Yeo, A., TSP Tour Domination and Hamilton Cycle Decomposition of Regular Digraphs, Operations Research Letters 28 (2001), 107-111.
11. Gutin, G., and Yeo, A., Polynomial Algorithms for the TSP and the QAP with a Factorial Domination Number, Discrete Applied Mathematics 119 (2002), 107-116.
12. Gutin, G., Yeo, A., and Zverovich, A., Exponential Neighborhoods and Domination Analysis for the TSP, in Traveling Salesman Problem and its Variations, pp. 223-256, Gutin, G., and Punnen, A., (editors), Kluwer, Boston, MA, 2002.
13. Gutin, G., Yeo, A., and Zverovich, A., Traveling Salesman Should Not Be Greedy: Domination Analysis of Greedy Type Heuristics for the TSP, Discrete Applied Mathematics 117 (2002), 81-86.
14. Klyaus, P.S., The Structure of the Optimal Solution of Certain Classes of Travelling Salesman Problem, Vestsi Akademii Nauk BSSR, Phys. Math. Sci., Minsk 1 (1976), 95-98.
15. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., The Traveling Salesman Problem, Wiley, New York, 1985.
16. Lin, S., and Kernighan, B.W., An Effective Heuristic Algorithm for the Traveling Salesman Problem, Operations Research 21 (1973), 972-989.
17. Papadimitriou, C.H., and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
18. Papadimitriou, C.H., and Vazirani, U., On Two Geometric Problems Related to the Traveling Salesman Problem, Journal of Algorithms 5 (1984), 231-246.
19. Punnen, A.P., The Traveling Salesman Problem: New Polynomial Appro-ximation Algorithms and Domination Analysis, Journal of Information and Optimization 22 (2001), 191-206.
20. Punnen, A.P., and Glover, F., Implementing Ejection Chains with Combinatorial Leverage for the TSP, Research Report, University of Colorado-Boulder, 1996.
21. Punnen, A.P., and Kabadi, S.N., Domination Analysis of Some Heuristics for the Traveling Salesman Problem, Discrete Applied Mathematics, 119 (2002), 117-128.
22. Radzik, T., Parametric Flows, Weighted Means of Cuts and Fractional Combinatorial Optimization, in Complexity in Numerical Optimization, pp. 351-383, Pardalos, P.M. (editor), World Scientific, Singapore, 1993.
23. Rublineckii, V.I., Estimates of the Accuracy of Procedures in the Traveling Salesman Problem (in Russian), Numerical Mathematics and Computer Technology IV (1973), 18-23.
24. Sarvanov, V.I., The Mean Value of the Functional of the Assignment Problem (in Russian), Vestsi Akadèii Navuk BSSR. Seryya Fi Zi ka-Matèmatychnykh Navuk 143(2) (1976), 111-114.
25. Sarvanov, V.I., and Doroshko, N.N., Approximate Solution of the Traveling Salesman Problem by a Local Algorithm with Scanning Neighborhoods of Factorial Cardinality in Cubic Time (in Russian), Software: Algorithms and Programs, No. 31, pp. 11-13, Mathematics Institute of the Belorussia Academy of Science, Minsk, 1981.
26. Sahni, S., and Gonzalez, T., P-Complete Approximation Problem, Journal of ACM 23 (1976), 555-565.
27. *, 2m ≥ 8, Journal of Combinatorial Theory, Series B 29 (1980), 68-74.
28. Vizing, V.G., Values of the Target Functional in a Priority Problem That Are Majorized by the Mean Value (in Russian), Kibernetika (Kiev) No. 5 (1973), 76-78.
29. Yeo, A., Large Exponential Neighborhoods for the Traveling Salesman Problem, Preprint No. 47, Department of Mathematics and Computer Science, Odense University, 1997.