On the partial order polytope of a digraph

Mathematical Programming, Series B

Volumn 73, Issue 1, 1996, Pages 31-49

  Müller, Rudolf ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Acyclic subdigraph polytope; Faces; Linear ordering polytope; Partially ordered set; Polyhedral combinatorics; Separation

Indexed keywords

EID: 0007156280     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592097     Document Type: Article

References (27)

1. P. Afentakis, "A model for layout design in FMS," in: A. Kusiak, ed., Flexible Manufacturing Systems: Methods and Studies, (North-Holland, Amsterdam, 1986) pp. 127-139.
2. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice-Hall, Englewood Cliffs, NY, 1993).
3. F. Barahona and A.R. Mahjoub, "On the cut polytope," Mathematical Programming 36 (1985) 157-173.
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, London, 1976).
5. A. Caprara and M. Fischetti, "Odd cut-sets, odd cycles and 0-1/2 Chvàtal-Gomory cuts," Technical Report, DEIS, University of Bologna (1993).
6. A. Caprara and M. Fischetti, "{0-1/2}-Chvàtal - Gomory cuts," Technical Report, DEIS, University of Bologna (1995).
7. S. Chopra and M.R. Rao, "The partition problem," Mathematical Programming 59 (1993) 87-115.
8. V. Chvátal, "Edmonds polytopes and a hierarchy of combinatorial problems," Discrete Mathematics 4 (1973) 305-337.
9. M. Deza, M. Grötschel and M. Laurent, "Clique-web facets for multicut polytopes," Mathematics of Operations Research 17 (1992) 981-1000.
10. P.C. Fishburn, "Binary probabilities induced by rankings," SIAM Journal on Discrete Mathematics 3 (1990) 478-488.
11. P.C. Fishburn, "Induced binary probabilities and the linear ordering polytope: a status report," Mathematical Social Sciences 23 (1992) 67-80.
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
13. M. Grötschel, M. Jünger and G. Reinelt, "On the acyclic subgraph polytope," Mathematical Programming 33 (1985) 28-42.
14. M. Grötschel, M. Jünger and G. Reinelt, "Facets of the linear ordering polytope," Mathematical Programming 33 (1985) 43-60.
15. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
16. M. Grötschel and Y. Wakabayashi, "A cutting plane algorithm for a clustering problem," Mathematical Programming 45 (1989) 59-96.
17. M. Grötschel and Y. Wakabayashi, "Facets of the clique partitioning polytope," Mathematical Programming 47 (1990) 367-388.
18. M. Jünger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Research and Expositions in Mathematics, Vol. 7, (Heldermann, Berlin, 1985).
19. J. Leung, "Polyhedral structure and properties of a model for layout design," Technical Report 90-13, Department of Operations Research, Yale University, New Haven, CT (1990).
20. J. Leung and J. Lee, "More facets from fences for linear ordering and acyclic subgraph polytopes," Discrete Applied Mathematics 50 (1994) 185-200.
21. R. Müller, "Bounds for linear VLSI problems," Ph.D. thesis, Fachbereich Mathematik, Technische Universität Berlin (1993).
22. R. Müller, "On the transitive acyclic subdigraph polytope," in: G. Rinaldi and L. Wolsey, eds., Integer Programming and Combinatorial Optimization, Proceedings of the Third IPCO Conference (1993) pp. 463-477.
23. R. Müller and A.S. Schulz, "The interval order polytope of a digraph," in: E. Balas and J. Clausen, eds., Integer Programming and Combinatorial Optimization, Proceedings of the Fourth IPCO Conference, (Springer, Berlin, 1995) pp. 50-64.
24. G. Reinelt, The Linear Ordering Problem: Algorithms and Applications, Research and Expositions in Mathematics, Vol. 8, (Heldermann, Berlin, 1985).
25. G. Reinelt, "A note on small linear ordering polytopes," Report 329, Universität Augsburg (1991).
26. A. Schrijver, Theory of Linear and Integer Programming (Wiley, New York, 1986).
27. Y. Wakabayashi, private communication.