Lifted cycle inequalities for the asymmetric traveling salesman problem

Mathematics of Operations Research

Volumn 24, Issue 2, 1999, Pages 273-292

  Balas, Egon ^a   Fischetti, Matteo ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; EQUIVALENCE CLASSES; MATHEMATICAL TECHNIQUES; PROBLEM SOLVING;

ASYMMETRIC TRAVELING SALESMAN PROBLEM; LIFTED CYCLE INEQUALITIES;

TRAVELING SALESMAN PROBLEM;

EID: 0032676931     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.2.273     Document Type: Article

References (16)

1. Ascheuer, N., M. Fischetti, M. Grötschel. 1997. A polyhedral study of the asymmetric traveling salesman problem with time windows. Technical Report, ZIB, Berlin, February.
2. Balas, E. 1989. The asymmetric assignment problem and some new facets of the traveling salesman polytope. SIAM J. Disc. Math. 2 425-451.
3. _, M. Fischetti. 1992. The fixed-outdegree 1-arborescence polytope. Math. Op. Res. 17 1001-1018.
4. _, _. 1993a. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Math. Programming 58 325-352.
5. _, _. 1993b. On the monotonization of polyhedra. G. Rinaldi and L. Wolsey, eds. Integer Programming and Combinatorial Optimization (Proceedings of IPCO 3), 23-38.
6. Chopra, S., G. Rinaldi. 1990. The graphical asymmetric traveling salesman polyhedron. R. Kannan and W. Pulleyblank, eds. Integer Programming and Combinatorial Optimization (Proceedings of IPCO 1), 129-146.
7. Chvátal, V., W. Cook, M. Hartmann. 1989. On cutting plane proofs in combinatorial optimization. Linear Algebra Appl. 114/115 455-499.
8. Fischetti, M. 1990. Facets of the asymmetric traveling salesman polytope. Math. Oper. Res. 16 129-146.
9. _. 1992. Three lifting theorems for the asymmetric traveling salesman polytope. E. Balas, G. Cornuéjols and R. Kannan, eds. Integer Programming and Combinatorial Optimization (Proceedings of IPCO 2), 260-273.
10. Grötschel, M., M. W. Padberg. 1977. Lineare Charakterisierungen von Travelling Salesman Problemen. Zeitschrift Für Op. Res. 21 33-64.
11. _, _. 1985. Polyhedral theory. E. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. Shmoys, eds. The Traveling Salesman Problem: A Guided Tour to Combinatorial Optimization, Wiley, 251-306.
12. Hao, J., J. Orlin. 1992. A faster algorithm for finding the minimum cut in a graph. Proceedings of the 3rd ACM-SIAM Syposium on Discrete Algorithms, 165-174.
13. Jünger, M , G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhäuser, eds. Network Models. North-Holland, 225-330.
14. Karp, R. 1972. Reducibility among combinatorial problems. R. E. Miller and J. W. Thatcher, eds. Complexity of Computer Computations, Plenum Press, 85-103.
15. Queyranne, M., Y. Wang. 1990. Symmetric inequalities and their composition for asymmetric traveling salesman polytopes. Working Paper 90-MSC-002, University of British Columbia, revised 1994.
16. _, _. 1994. On the Chvátal rank of certain inequalities. Report, University of British Columbia, Vancouver, BC.