On the monotonization of polyhedra

Mathematical Programming, Series B

Volumn 78, Issue 1, 1996, Pages 59-84

  Balas, Egon ^a   Fischetti, Matteo ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Dominant; Monotone polyhedra; Polyhedral combinatorics; Submissive

Indexed keywords

EID: 0041104390     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. E. Balas, The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph, SIAM Journal on Discrete Mathematics 2 (1989) 425-451.
2. E. Balas, Finding out whether a valid inequality is facet defining, in: R. Kannan and W.R. Pulleyblank, eds., Integer Programming and Combinatorial Optimization (University of Waterloo Press, 1990) 45-61.
3. E. Balas and M. Fischetti, The fixed-outdegree 1-arborescence polytope, Mathematics of Operations Research 17 (1992) 1001-1018.
4. E. Balas and M. Fischetti, A lifting procedure for the asymmetric traveling salesman polytope and a large class of new facets, Mathematical Programming 58 (1993) 325-352.
5. S.C. Boyd and W.R. Pulleyblank, Facet generating techniques, Department of Combinatorics and Optimization, University of Waterloo, 1991.
6. S. Chopra and G. Rinaldi, The graphical asymmetric traveling salesman polyhedron, in: R. Kannan and W.R. Pulleyblank, eds., Integer Programming and Combinatorial Optimization (University of Waterloo Press, 1990).
7. W. Cunningham and J. Green-Krotki, Dominants and submissives of matching polyhedra, Mathematical Programming 36 (1986) 228-237.
8. M. Fischetti, Facets of the asymmetric traveling salesman polytope, Mathematics of Operations Research 16 (1991) 42-56.
9. M. Fischetti, Three facet lifting theorems for the asymmetric traveling salesman polytope, in: E. Balas, G. Cornuejols and R. Kannan, eds., Integer Programming and Combinatorial Optimization (Proceedings of IPCO 2), GSIA, Carnegie Mellon University (1992) 260-273.
10. M. Grötschel, Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme (Hain, Maisenheim am Glen, 1977).
11. M. Grötschel, M. Jünger and G. Reinelt, On the acyclic subgraph polytope, Mathematical Programming 33 (1985) 28-42.
12. M. Grötschel, M. Jünger and G. Reinelt, Facets of the linear ordering polytope, Mathematical Programming 33 (1985) 43-60.
13. M. Grötschel and M. Padberg, Polyhedral theory, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys, eds., The Traveling Salesman Problem (Wiley, New York, 1985) 251-305.
14. M. Grötschel and W.R. Pulleyblank, Clique tree inequalities and the symmetric traveling salesman problem, Mathematics of Operations Research 11 (1986) 537-569.
15. F. Margot, Composition de polytopes combinatoires: Une approche par projection, Thèse de doctorat No. 1209, EPF Lausanne, Switzerland, 1994.
16. D. Naddef and G. Rinaldi, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Mathematical Programming 58 (1993) 53-87.
17. G.L. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
18. M. Queyranne and Y. Wang, Hamilton path and symmetric travelling salesman polytopes, Working Paper 89-MSc-009, University of British Columbia, Vancouver, 1989.
19. M. Queyranne and Y. Wang, Symmetric inequalities and their composition for asymmetric travelling salesman polytopes, 1994; Submitted to Mathematical Programming.
20. G. Rinaldi and L.A. Wolsey, Integer Programming and Combinatorial Optimization (Proceedings of IPCO 3), CORE, Louvain-la-Neuve, Belgium, 1993.