A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem

Mathematical Programming, Series B

Volumn 87, Issue 3, 2000, Pages 519-542

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

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b Institut fur Mathematik   (Austria)

Author keywords

Combinatorial optimization; Local search; Neighborhood; NP completeness; Polynomial time algorithm; Quadratic Assignment Problem; Search problem; Travelling Salesman Problem

Indexed keywords

EID: 8344239073     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050010     Document Type: Article

References (36)

1. Aarts, E., Lenstra, J.K. (eds.) (1997): Local Search in Combinatorial Optimization. John Wiley, New York
2. Aurenhammer, F. (1988): On-line sorting of twisted sequences in linear time. BIT 28, 194-204
3. Balas, E., Simonetti, N. (1996): Linear time dynamic programming algorithms for some new classes of restricted travelling salesman problems. Management Science Research Report # MSSR-617, Carnegie Mellon University, July 1996. A preliminary version appeared in Proceedings of IPCO V, LNCS 1084, pp. 316-329. Springer Verlag
4. Booth, K.S., Lueker, G.S. (1976): Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335-379
5. Burkard, R.E. (1990): Locations with spatial interactions: the quadratic assignment problem. In: Discrete Location Theory, Chapt. 9 (Mirchandani, P.B., Francis, R.L. (eds.)), pp. 387-437. John Wiley, New York
6. Burkard, R.E., Deǐneko, V.G., Woeginger, G.J. (1998): The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 23, 613-623.
7. A preliminary version appeared in Proceedings of IPCO V, LNCS 1084, pp. 490-504. Springer Verlag, 1996
8. Carlier, J., Villon, P. (1990): A new heuristic for the travelling salesman problem. RAIRO - Oper. Res. 24, 245-253
9. Chandra, B., Karloff, H., Tovey, C. (1994): New results on the old k-opt algorithm for the TSP. In: Proceedings of 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 150-159
10. Cornuejols, G., Naddef, G.D., Pulleyblank, W.R. (1983): Halin graphs and the travelling salesman problem. Math. Program. 26, 287-294
11. Croes, G.A. (1958): A method for solving travelling-salesman problems. Oper. Res. 6, 791-812
12. Dilworth, R.P. (1950): A decomposition theorem for partially ordered sets. Ann. Math. 51, 161-166
13. Fonlupt, J., Nachef, A. (1993): Dynamic programming and the graphical travelling salesman problem. J. Assoc. Comput. Mach. 40, 1165-1187
14. Garey, M.R., Johnson, D.S. (1979): Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco
15. Gilmore, P.C., Lawler, E.L., Shmoys, D.B. (1985): Well-solved special cases. Chapt. 4 in [25], pp. 87-143
16. Glover, F., Punncn, A.P. (1997): The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms. J. Oper. Res. Soc. 48, 502-510
17. Gutin, G. (1997): Exponential neighborhoods local search for the travelling salesman problem. Research Report TR/2/97, Brunel University, Uxbridge, February 1997
18. Held, M., Karp, R.M. (1962): A dynamic programming approach to sequencing problems. J. SIAM 10, 196-210
19. Hoffmann, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.E. (1986): Sorting Jordan sequences in linear time using level-linked search trees. Information and Control 68, 170-184
20. Johnson, D.S., McGeoch, L.A. (1997): The travelling salesman problem: a case study. Chapt. 8 in [1], pp. 215-310
21. Kern, W. (1989): A probabilistic analysis of the switching algorithm for the Euclidean TSP. Math. Program. 44, 213-219
22. Klyaus, P.S. (1976): The structure of the optimal solution of certain classes of travelling salesman problems (in Russian). Vestsi Akad. Nauk BSSR, Phys. Math. Sci., Minsk, pp. 95-98
23. Koopmans, T.C., Beckmann, M.J. (1957): Assignment problems and the location of economic activities, Econometrica 25, 53-76
24. Lawler, E.L. (1963): The quadratic assignment problem. Manage. Sci. 9, 586-599
25. Lawler, E.L. (1975): The quadratic assignment problem: a brief review. In: Combinatorial Programming: Methods and Applications (Roy, B. (ed.)), Dordrecht, Holland, pp. 351-360
26. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) (1985): The travelling salesman problem. John Wiley, Chichester
27. Lin, S. (1965): Computer solutions to the travelling salesman problem. Bell System Tech. J. 44, 2245-2269
28. Möhring, R.H. (1989): Computationally tractable classes of ordered sets. In: Algorithms and Order (Rival, I. (ed.)). Kluwer Academic Publishers, pp. 105-193
29. Papadimitriou, C.H., Steiglitz, K. (1977): On the complexity of local search for the travelling salesman problem. SIAM J. Comput. 6, 76-83
30. Papadimitriou, C.H., Steiglitz, K. (1978): Some examples of difficult travelling salesman problems. Oper. Res. 26, 434-443
31. Papadimitriou, C.H., Steiglitz, K. (1982): Combinatorial optimization: algorithms and complexity. Prentice Hall, New Jersey
32. Pardalos, P., Rendl, E, Wolkowicz, H. (1994): The Quadratic Assignment Problem: A Survey and Recent Developments. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, (Pardalos, P., Wolkowicz, H. (eds.)), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 1-42
33. Reinelt, G. (1994): The travelling salesman problem: Computational solutions for TSP applications. LNCS 840, Springer Verlag, Berlin
34. Sarvanov, V.I., Doroshko, N.N. (1981): The approximate solution of the travelling salesman problem by a local algorithm that searches neighborhoods of exponential cardinality in quadratic time (in Russian). Software: Algorithms and Programs 31, Mathematical Institute of the Belorussian Academy of Sciences, Minsk, pp. 8-11
35. Sarvanov, V.I., Doroshko, N.N. (1981): The approximate solution of the travelling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time (in Russian). Software: Algorithms and Programs 31, Mathematical Institute of the Belorussian Academy of Sciences, Minsk, pp. 11-13
36. Tovey, C.A. (1997): Local improvement on discrete structures. Chapt. 3 in [1], pp. 57-89