On extended formulations for the precedence constrained asymmetric traveling salesman problem

Networks

Volumn 48, Issue 2, 2006, Pages 77-89

  Gouveia, L ^a   Pesneau, P ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Asymmetric traveling salesman problem; Cutting plane; Precedence constraints; Projection

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATION THEORY; CONSTRAINT THEORY; POLYNOMIALS;

ASYMMETRIC TRAVELING SALESMAN PROBLEMS; CUTTING PLANE; PRECEDENCE CONSTRAINTS; PROJECTION;

TRAVELING SALESMAN PROBLEM;

EID: 33747859898     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20122     Document Type: Conference Paper

References (24)

1. N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, PhD thesis, Tech. Univ., Berlin, 1995.
2. N. Ascheuer, L. Escudero, M. Grötschel, and M. Stoer, A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing), SIAM J Optimizat 3 (1993), 25-42.
3. N. Ascheuer, M. Jünger, and G. Reinelt, A branch-and-cut algorithm for the asymmetric traveling salesman problem with precedence constraints, Computat Optimizat Applica 17 (2000), 61-84.
4. E. Balas, M. Fischetti, and W.R. Pulleyblank, The precedence-constrained asymmetric traveling salesman polytope, Math Program 68 (1995), 241-265.
5. L. Bianco, A. Mingozzi, S. Ricciardelli, and M. Spadoni, Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming, INFOR 32 (1994), 19-31.
6. A. Caprara and M. Fischetti, 0-1/2 chvatal-gomory cuts, Math Program 74 (1996), 221-235.
7. A. Claus, A new formulation for the travelling salesman problem, SIAM J Algebraic Discrete Methods 5 (1984), 21-25.
8. M. Desrochers and G. Laporte, Improvements to the Miller-Tucker-Zemlin subtour elimination constraints, Oper Res Lett 10 (1991), 27-36.
9. M. Fischetti and P. Toth, A polyhedral approach to the asymmetric traveling salesman problem, Manage Sci 43 (1997), 1520-1536.
10. L. Gouveia and J.M, Pires, The assymetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints, Eur J Oper Res 112 (1999), 134-146.
11. L. Gouveia and J.M, Pires, The asymmetric travelling salesman problem: On generalizations of disaggregated Miller-Tucker-Zemlin constraints, Discrete Appl Math 112 (2001), 129-145.
12. M. Grötschel, M. Jünger, and G. Reinelt, A cutting plane algorithm for the linear ordering problem, Oper Res 32 (1984), 1195-1220.
13. M. Grötschel, M. Jünger, and R. Reinelt, Facets of the linear ordering polytope, Math Program 33 (1985), 43-60.
14. M. Grötschel and M. Padberg, "Polyhedral theory," The traveling salesman problem: A guided tour of combinatorial optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Editors), John Wiley, New York, 1985, pp. 251-305.
15. A. Langevin, F. Soumis, and J. Desrosiers, Classification of travelling salesman problem formulations, Oper Res Lett 9 (1990), 127-132.
16. E.L. Lawler, J.K. Lenstra, A. Rinnooy-Kan, and D.B. Shmoys, The travelling salesman problem, Wiley, New York, 1985.
17. C. Miller, A Tucker, and R. Zemlin, Integer programming formulations and the travelling salesman problems, J ACM 7 (1960), 326-329.
18. A. Mingozzi, L. Bianco, and S. Ricciardelli, Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints, Oper Res 45 (1997), 365-377.
19. Y-S. Myung, Projections of extended formulations with precedence variables for the asymmetric traveling salesman problem, Int J Manage Sci 7 (2001), 1-11.
20. M. Padberg and T.-Y. Sung, An analytical comparison of different formulations of the travelling salesman problem, Math Program 52 (1991), 315-357.
21. J.M. Pires, Formulações para o Problema do Caixeiro Viajante Assimétrico e sua aplicação a um Problema de Desenho de Redes com Topologia en Forma de Anel, PhD thesis, Faculdade de Ciências da Universidade de Lisboa, 2001.
22. S.C. Sarin, H.D. Sherali, and A. Bhootra, New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints, Oper Res Lett 33 (2005), 62-70.
23. M.T. Fiala Timlin and W.R. Pulleyblank, Precedence constrained routing and helicopter scheduling: Heuristic design, Interfaces 22 (1992), 100-111.
24. R. Wong, "Integer programming formulations of the travelling salesman problem," Proceedings of the ieee international conference of circuits and computers, 1980, pp. 149-152.