New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization

Discrete Applied Mathematics

Volumn 119, Issue 1-2, 2002, Pages 149-167

  Kabadi, Santosh N ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (24)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms and Applications 1993 Prentice-Hall Englewood Cliffs, NJ
2. Md.F. Baki, Solvable cases of traveling salesman problem, Masters Thesis, University of New Brunswick, Canada, 1995.
3. M.O. Ball, and M.J. Magazine Sequencing of insertions in printed circuit board assembly Oper. Res. 36 2 1988 192 201
4. L. Bodin, B. Golden, A. Assad, and M. Ball The state of the art in the routing and scheduling of vehicles and crews Comput. Oper. Res. 10 1983 63 211 (Pubitemid 13577352)
5. V.Y. Burdyuk, V.N. Trofimov, Generalization of the results of Gilmore and Gomory on the solution of the traveling salesman problem. Eng. Cybernet. 14 (1976) 12-18. (English translation from Izv. Akad. Nauk USSR, Tech. Kibernet. 3 (1976) 16-22.)
6. R. Burkard, V. Deineko, R. Van Dal, J. Van Der Veen, and G. Woeginger Well-solvable special cases of the traveling salesman problem: a survey SIAM Rev. 40 1998 496 546 (Pubitemid 128619818)
7. R.W. Cottle, and A.F. Veinott Jr. Polyhedral sets having a least element Math. Program. 3 1972 238 249
8. J. Fonlupt, and A. Nachef Dynamic programming and the graphical traveling salesman problem J. Assoc. Comp. Mach. 40 1993 1165 1187
9. G.N. Frederickson, and D.J. Guan Nonpreemptive ensemble motion planning on a tree J. Algorithm 15 1 1993 29 60
10. S.H. Fuller An optimal drum scheduling algorithm IEEE Trans. Comput. C-21 1972 1153 1165
11. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman San Francisco
12. R.S. Garfinkel Minimizing wallpaper waste, Part I: a class of traveling salesman problems Oper. Res. 25 1977 741 751
13. 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
14. P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well-Solved Special Cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985, pp. 87-143 (Chapter 4).
15. S.N. Kabadi, Computational complexity of some problems in graph theory, working paper, Faculty of Administration, University of New Brunswick, 1990.
16. S.N. Kabadi, and Md.F. Baki Gilmore-Gomory type traveling salesman problems Comput. Oper. Res. 26 1999 329 351 (Pubitemid 29346465)
17. S.N. Kabadi, R. Chandrasekaran, Generalized traveling salesman problem on a tree, working paper #90-027, Faculty of Administration, University of New Brunswick, 1990.
18. S.N. Kabadi, R. Chandrasekaran, Tree Traveling Salesman Problem (Extended Abstract), in: J.J. Urrutia (Ed.), Proceedings of the Second Canadian Conference on Computational Geometry, Ottawa, Ontario, 1990, pp. 367-371.
19. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization 1985 Wiley Chichester
20. N. Megiddo Combinatorial optimization with rational objective functions Math. Oper. Res. 4 1979 412 424
21. K.G. Murty Network Programming 1992 Prentice-Hall Englewood Cliffs, NJ
22. K.G. Murty Linear Programming 1986 Wiley New York
23. H.D. Ratliff, and A.S. Rosenthal Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem Oper. Res. 31 3 1983 507 521 (Pubitemid 13576748)
24. P.S. Sundararaghavan The unit capacity pickup and delivery problem on a one-way loop OPSEARCH 21 1984 209 226