Gilmore-Gomory type traveling salesman problems

Computers and Operations Research

Volumn 26, Issue 4, 1999, Pages 329-351

  Kabadi, S N ^a   Baki, Md Fazle ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

GILMORE-GOMORY METHOD;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; METHODOLOGY;

EID: 0032805511     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00066-5     Document Type: Article

References (30)

1. [1] Baki MF, Kabadi SN. Some sufficient conditions for pyramidal optimal traveling salesman tour, Working paper, Faculty of Administration, University of New Brunswick, Canada (1995).
2. [2] Baki MF. Solvable Cases of Traveling Salesman Problem. Masters thesis, University of New Brunswick, Canada, 1995.
3. [3] Burdyuk VY, Trofimov VN. Generalizations of the results of Gilmore and Gomory on the solution of the traveling salesman problem. Cybernetics (English translation from Izv. Akad. Nauk SSSR, Tech. Kibernet.) 1976;14:12-8.
4. [4] Burkard RE. Assignment problems: recent solution methods and applications. In: Prékopa A, Szelezan J. Strazicky B. editors. System Modelling and Optimization: Proceedings of the 12th IFIP Conference, Budapest, Hungary, September 2-6, 1985. Lecture Notes in Control and Information Science, Vol. 84, Berlin: Springer, 1986;153-69.
5. [4] Burkard RE. Assignment problems: recent solution methods and applications. In: Prékopa A, Szelezan J. Strazicky B. editors. System Modelling and Optimization: Proceedings of the 12th IFIP Conference, Budapest, Hungary, September 2-6, 1985. Lecture Notes in Control and Information Science, Vol. 84, Berlin: Springer, 1986;153-69.
6. [5] Burkard RE, Deineko VG. Polynomially solvable cases of the traveling salesman problem and a new exponential neighbourhood. Unpublished manuscript, 1994.
7. [6] Cechlárová K, Szabó P. On the Monge property of matrices. Discrete Mathematics 1990;81:123-8.
8. [7] Chandrasekaran R. Recognition of Gilmore-Gomory traveling salesman problem. Discrete Applied Mathematics 1986;14:231-8.
9. [8] Deineko VG, Filonenko VL. On the reconstruction of Specially Structured Matrices. Aktualnye Problemy, EVM, programmirovanije, Dnepropetrovsk, DGU 1979 (in Russian).
10. [9] Derigs U, Goecke O, Schrader R. Monge sequence and a simple assignment algorithm. Discrete Applied Mathematics. 1986;15:241-8.
11. [10] Gabovich EY. The small traveling salesman problem. Trudy Vyčisl. Centra Tartu. Gos. Univ. 1970;19:27-51 (in Russian).
12. [11] Gaikov NE. On the minimization of a linear form on cycles. Vesti. Akad. Navuk. BSSR. Ser. Fiz.-Mat. Navuk 1980;4:128 (in Russian).
13. [12] Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness, San Francisco: Freeman, 1979.
14. [13] Gilmore PC, Lawler EL, Shmoys DB. Well-solved special cases. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem: a guided tour of combinatorial optimization. Chichester: Wiley, 1985:87-143.
15. [14] Gilmore PC, Gomory RE. Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Operations Research 1964;12:655-79.
16. [15] Glover F, Punnen AP. The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. Working paper, University of Colorado at Boulder, 1995.
17. [16] Harary F. Graph theory. Addison-Wesley, Reading, MA, 1969.
18. [17] Hoffman AJ. On simple linear programming problems. Proceedings of the Symposium on Pure Mathematics VII, Convexity. Providence, RI: American Mathematical Society, 1963;317-27.
19. [18] Kabadi SN, Chandrasekaran R. Solvable classes of generalized traveling salesman problem, DIMCAS Series in Discrete Mathematics and Theoretical Computer Science. 1990;1:49-59.
20. [19] Kabadi SN, Chandrasekaran R. Generalized Traveling salesman problem on a tree, Working paper # 90-027, Faculty of Administration, University of New Brunswick, 1990.
21. [20] Klyaus PS. Structure of the optimal solution of certain classes of traveling salesman problems. Vesti Akad. Navuk BSSR, Ser. Fiz. - Mat Navuk. 1976;6:95-8 (in Russian).
22. [21] Kruskal JB Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 1956;7:48-50.
23. [22] Laporte G. The traveling salesman problem: an overview of exact and approximate algorithms, European Journal of Operational Research 1992;59:231-47.
24. [23] Lovász L. Matroid matching and some applications, Journal of Combinatorial Theory 1980;B28:208-36.
25. [24] Melamed II, Sergeev SI, Sigal IK. Traveling salesman problem. I. Theoretical issues, Automation and Remote Control (English Translation from Avtomatika i Telemekhanika) 1990;50:1147-73.
26. [25] Melamed II, Sergeev SI, Sigal IK. Traveling salesman problem. II. Exact methods, Automation and Remote Control, (English Translation from Avtomatika i Telemekhanika). 1990;50:1303-24.
27. [26] Park JK. A special case of the n-vertex traveling salesman problem that can be solved in O(n) time. Information Processing Letters 1991;40:247-54.
28. [27] Sarvanov VI. On the complexity of minimizing a linear form on a set of cyclic permutations. Soviet Mathematics Doklady. (English translation from Dokl. Akad. Nauk SSSR) 1978;22:118-20.
29. [28] Van Dal R, Jack AA, Van der Veen, Gerard S. Small and large TSP: two polynomially solvable cases of the traveling salesman problem. European Journal of Operational Research. 1993;69:107-20.
30. [29] Van der Veen, Jack AA. Solvable cases of the traveling salesman problem with various objective functions, Ph.D. thesis, University of Groningen, 1992.