The asymmetric travelling salesman problem: On generalizations of disaggregated Miller-Tucker-Zemlin constraints

Discrete Applied Mathematics

Volumn 112, Issue 1-3, 2001, Pages 129-145

  Gouveia, Luis ^a   Pires, Jose Manuel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Aggregation; Asymmetric travelling salesman problem; Generalized Miller Tucker Zemlin constraints; Lifted circuit inequalities; Multicommodity flows; Simple FD inequalities

Indexed keywords

EID: 0035885276     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00313-9     Document Type: Article

References (17)

1. Ahuja R., Magnanti T., Orlin J. Network Flows: Theory, Algorithms and Applications. 1995;Prentice-Hall, Englewood Cliffs, NJ.
2. E. Balas, M. Fischetti, Lifted cycle inequalities for the asymmetric travelling salesman problem, Management Science Research Report, No. MSRR-623, Carnegie Mellon University, 1997.
3. Balas E., Fischetti M. The fixed-outdegree 1-arborescence polytope. Math. Oper. Res. 17:1992;1001-1018.
4. Claus A. A new formulation for the travelling salesman problem. SIAM J. Algebraic Discrete Methods. 5:1984;21-25.
5. Desrochers M., Laporte G. Improvements to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10:1991;27-36.
6. M. Fischetti, Private communication to the authors, 1998.
7. Fischetti M. Facets of the asymmetric travelling salesman problem. Math. Oper. Res. 16:1991;42-56.
8. Fischetti M., Toth P. A polyhedral approach to the asymmetric travelling salesman problem. Management Sci. 43:1997;1520-1536.
9. Gouveia L. Using the Miller-Tucker-Zemlin constraints to formulate minimal spanning trees with hop constraints. Comput. Oper. Res. 22:1995;959-970.
10. Gouveia L., Pires J. The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. European J. Oper. Res. 112:1999a;134-146.
11. L. Gouveia, J. Pires, Models for a Steiner ring network design problem, Working paper 1/99, CIO/Fac. Ciências da Universidade de Lisboa, 1999b.
12. Grotschel M., Padberg M. Polyhedral theory. Lawler E.L., Lenstra J.K., Rinnooy Kan A., Shmoys D.B. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1985;Wiley, New York.
13. Langevin A., Soumis F., Desrosiers J. Classification of travelling salesman problem formulations. Oper. Res. Lett. 9:1990;127-132.
14. Lawler E.L., Lenstra J.K., Rinnooy Kan A., Shmoys D.B. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. 1985;Wiley, New York.
15. Miller C., Tucker A., Zemlin R. Integer programming formulations and travelling salesman problems. J. ACM. 7:1960;326-329.
16. R. Wong, Integer programming formulations of the travelling salesman problem, Proceedings of the IEEE International Conference of Circuits and Computers, 1980, pp. 149-152.
17. M. Gendreau, M. Labbé and G. Laporte, Efficient Heuristics for the Design of Ring Networks, Telecommunications Systems, Vol. 4, 1995.