Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem

References

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