The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints

European Journal of Operational Research

Volumn 112, Issue 1, 1999, Pages 134-146

  Gouveia, Luis ^a   Pires, Jose Manuel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Asymmetric travelling salesman problem; Dk and Dk inequalities; Miller Tucker Zemlin constraints; Projection; Reformulation

Indexed keywords

CONSTRAINT THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; RELAXATION PROCESSES;

MILLER-TUCKER-ZEMLIN CONSTRAINTS;

TRAVELING SALESMAN PROBLEM;

EID: 0032736580     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00358-5     Document Type: Article

References (16)

1. Ahuja, R., Magnanti, T., Orlin, J., 1995. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey.
2. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M., 1954. Solutions of large scale travelling salesman problem. Operations Research 2, 393-410.
3. Desrochers, M., Laporte, G., 1991. Improvements to the Miller-Tucker-Zemlin subtour elimination constraints. Operation Research Letters 10, 27-36.
4. Fischetti, M., 1991. Facets of the asymmetric traveling salesman problem. Mathematics of Operations Research 16, 42-56.
5. Fischetti, M., Toth, P., 1996. A polyhedral approach to the asymmetric traveling salesman problem. Working paper.
6. Gavish, B., Graves, S., 1979. The travelling salesman problem and related problems. Working paper.
7. Gendreau, M., Labbé, M., Laporte, G., 1995. Efficient heuristics for the design of ring networks. Telecommunication Systems 4, 177-188.
8. Gouveia, L., 1995a. A result on projection for the vehicle routing problem. European Journal of Operational Research 85, 610-624.
9. Gouveia, L., 1995b. Using the Miller-Tucker-Zemlin constraints to formulate minimal spanning trees with hop constraints. Computers and Operations Research 22, 959-970.
10. Grotschel, M., Padberg, M., 1985. Polyhedral theory. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A., Shmoys, D.B. (Eds.), The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York.
11. Langevin, A., Soumis, F., Desrosiers, J., 1990. Classification of travelling salesman problem formulation. Operations Research Letters 9, 127-132.
12. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A., Shmoys, D.B., 1985. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York.
13. Miller, C., Tucker, A., Zemlin, R., 1960. Integer programming formulations and travelling salesman problems. Journal of ACM 7, 326-329.
14. Padberg, M., Sung, T., 1991. An analytical comparison of different formulations of the travelling salesman problem. Mathematical Programming 52, 315-357.
15. Pulleyblank, W., 1989. Polyhedral combinatorics. In: Handbooks in OR and MS, vol. 1. North-Holland, Amsterdam.
16. Wong, R., 1980. Integer programming formulations of the travelling salesman problem. In: Proceedings of the IEEE International Conference of Circuits and Computers, pp. 149-152.