TSP tour domination and Hamilton cycle decompositions of regular digraphs

Operations Research Letters

Volumn 28, Issue 3, 2001, Pages 107-111

  Gutin, Gregory ^a   Yeo, Anders ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

ATSP; Domination analysis; Hamilton cycle decomposition; Regular digraphs

Indexed keywords

ALGORITHMS; DECOMPOSITION; HAMILTONIANS; HEURISTIC METHODS; POLYNOMIALS;

HAMILTON CYCLE DECOMPOSITIONS; REGULAR DIGRAPHS;

TRAVELING SALESMAN PROBLEM;

EID: 0035305859     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00053-0     Document Type: Article

References (21)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows. 1993;Prentice-Hall, Englewood Cliffs, NJ.
2. B. Alspach, J.-C. Bermond, D. Sotteau, Decomposition into cycles I: Hamilton decompositions, in: G. Hahn et al. (Eds.), Cycles and Rays, Kluwer, Dordrecht, 1990, pp. 9-18.
3. E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP's, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, 1996, pp. 316-329.
4. Bang-Jensen J., Gutin G. Digraphs: Theory, Algorithms and Applications. 2000;Springer, London.
5. Bondy J.A., Murty U.R.S. Graph Theory with Applications. 1976;North-Holland, New York.
6. R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, 1996, pp. 490-504.
7. Carlier J., Villon P. A new heuristic for the traveling salesman problem. RAIRO Oper. Res. 24:1990;245-253.
8. Glover F., Gutin G., Yeo A., Zverovich A. Construction heuristics for the asymmetric traveling salesman problem. European J. Oper. Res. 129:2001;555-568.
9. Glover F., Punnen A.P. The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. J. Oper. Res. Soc. 48:1997;502-510.
10. G. Gutin, On an approach for solving the traveling salesman problem, Proceedings of the USSR Conference on System Res. Moscow, 1984, pp. 184-185 (in Russian).
11. Gutin G. Exponential neighbourhood local search for the traveling salesman problem. Comput. Oper. Res. 26:1999;313-320.
12. Gutin G., Yeo A. Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. 26:1999;321-327.
13. G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with factorial domination number, Discrete Appl. Math., to appear.
14. R. Häggkvist, Series of lectures on Hamilton decomposition, British Combinatorial Conference, Swansea, UK, 1981, International Conference on Convexity and Graph Theory, Israel, March 1981, and Seminar Orsey, France, 1986.
15. R. Häggkvist, Roland.Haggkvist@math.umu.se, personnal communications, 1999-2000.
16. Moon J.W. Topics on Tournaments. 1968;Holt, Rinehart and Winston, New York.
17. C.N. Potts, S.L. van de Velde, Dynaserach - iterative local improvement by dynamic programming: Part I, The traveling salesman problem, Technical Report, University of Twente, The Netherlands, 1995.
18. A.P. Punnen, The traveling salesman problem: new polynomial approximation algorithms and domination analysis, J. Inform. Optim. Sci., to appear.
19. A.P. Punnen, S.N. Kabadi, Domination analysis of some heuristics for the asymmetric traveling salesman problem, submitted.
20. V.I. Sarvanov, N.N. Doroshko, Approximate solution of the traveling salesman problem by a local algorithm with scanning neighbourhoods of factorial cardinality in cubic time, Software: Algorithms and Programs. Math. Institute of Belorussian Acad. of Sci., Minsk, no. 31, 11-13, 1981 (in Russian).
21. *, m≥ 8 J. Combin. Theory. B 29:1980;68-74.