Domination analysis of some heuristics for the traveling salesman problem

Discrete Applied Mathematics

Volumn 119, Issue 1-2, 2002, Pages 117-128

  Punnen, Abraham ^a   Kabadi, Santosh ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Approximation algorithms; Computational complexity; Traveling salesman problem

Indexed keywords

EID: 84867965201     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00268-2     Document Type: Article

References (23)

1. E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new class of restricted TSP's, Proceedings IPCO V, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 316-329.
2. R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Proceedings IPCO V, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 490-504.
3. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, 1976.
4. P.C. Gilmore, and R.E. Gomory Sequencing a one state-variable machine: a solvable case of the traveling salesman problem Oper. Res. 12 1964 655 679
5. L. Grover Local search and the local structure of NP-complete problems Oper. Res. Lett. 12 1992 235 243
6. F. Glover, 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 Appl. Math. 65 (1996) 223-253). (Pubitemid 126386270)
7. F. Glover, and A.P. Punnen The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms J. Oper. Res. Soc. 48 1997 502 510 (Pubitemid 127599406)
8. G. Gutin, On approach to solving the traveling salesman problem, in: Theory, Methodology, and Practice of System Research, Mathematical Methods of System Analysis, VNIISI, Moscow, 1984, pp. 184-186.
9. G. Gutin On the efficiency of a local algorithm for solving the traveling salesman problem Automat. Remote Control (part 2) 11 1988 1514 1519
10. G. Gutin Exponential neighborhood local search for the traveling salesman problem Comput. Oper. Res. 26 1999 313 320 (Pubitemid 29346463)
11. G. Gutin, A. Yeo, TSP heuristics with large domination number, Technical Report No 12/98, Department of Maths and Stats, Brunel University, 1998.
12. G. Gutin, A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial domination number, Discrete Appl. Math. 119 (2002) 107-116.
13. S.N. Kabadi, and Md F. Baki Gilmore-Gomory type traveling salesman problem Comput. Oper. Res. Special issue on Traveling Salesman Problem 26 1999 329 351 (Pubitemid 29346465)
14. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys The Traveling Salesman Problem 1985 Wiley New York
15. C.N. Potts, S.L. Van de Velde, Dynasearch - iterative local improvement by dynamic programming: Part I, The traveling salesman problem, Technical Report, University of Twente, The Netherlands, 1995.
16. A.P. Punnen The traveling salesman problem: new polynomial approximation algorithms and domination analysis J. Inform. Optim. 22 2001 191 206 (Pubitemid 33246964)
17. A.P. Punnen, F. Margot, S.N. Kabadi, TSP heuristics: domination analysis and complexity, Technical Report 2001-06, Department of Mathematics, University of Kentucky, USA.
18. V.I. Rublineckii, Estimates of the accuracy of procedures in the traveling salesman problem, Numer. Math. Comput. Technol. IV (1973) 18-23 (Russian).
19. V.I. Sarvanov The mean value of the functional of the assignment problem Vestsf. Akad. Navuk BSSR Ser. Fiz. -Mat. Navuk 143 2 1976 111 114
20. V.I. Sarvanov, N.N. Doroshko, Approximate solution of the traveling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time, in: Software: Algorithms and Programs, Mathematics Institute of the Belorussia Academy of Science, Minsk, No. 31, 1981, pp. 11-13 (in Russian).
21. S. Sahni, and T. Gonzalez P-complete approximation problem J. ACM 23 1976 555 565
22. V.G. Vizing, Values of the target functional in a priority problem that are majorized by the mean value, Kibernetika (Kiev) 5 (1973), 76-78 (Russian).
23. A. Yeo, Large exponential neighborhoods for the traveling salesman problem, Preprint No. 47, Department of Maths and CS, Odense University, 1997.