A combinatorial study of partial order polytopes

European Journal of Combinatorics

Volumn 24, Issue 2, 2003, Pages 149-159

  Fiorini, Samuel ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038713661     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0195-6698(03)00009-X     Document Type: Article

References (23)

1. Arditti J.-C. Partially ordered sets and their comparability graphs, their dimension and their adjacency Colloques internationaux (C.N.R.S.) 260 1976 5-8
2. Billera L.J. Sarangarajan A. All 0-1 polytopes are traveling salesman polytopes Combinatorica 16 2 1996 175-188
3. Bolotashvili G.G. Kovalev M. Girlich E. New facets of the linear ordering polytope SIAM Journal on Discrete Mathematics 12 3 1999 326-336
4. Borndörfer R. Weismantel R. Set packing relaxations of some integer programs Mathematical Programming 88a 3 2000 425-450
5. Doignon J.-P. Fiorini S. Facets of the weak order polytope derived from the induced partition projection SIAM Journal on Discrete Mathematics 15 1 2002 112-121
6. Fiorini S. Determining the automorphism group of the linear ordering polytope Discrete Applied Mathematics 112 2001 121-128
7. S. Fiorini, Polyhedral Combinatorics of Order Polytopes, Ph.D. Thesis, Université Libre de Bruxelles, Brussels, Belgium, 2001
8. S. Fiorini, P.C. Fishburn, Facets of linear signed order polytopes, Discrete Applied Mathematics (2003) accepted for publication
9. S. Fiorini, P.C. Fishburn, Weak order polytopes (2003) submitted
10. Fishburn P.C. Induced binary probabilities and the linear ordering polytope: a status report Mathematical Social Sciences 23 1992 67-80
11. Garey M.R. Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness 1979 Freeman New York
12. Grötschel M. Jünger M. Reinelt G. A cutting plane algorithm for the linear ordering problem Operations Research 32 1984 1195-1220
13. Grötschel M. Jünger M. Reinelt G. Facets of the linear ordering polytope Mathematical Programming 33 1985 43-60
14. M.A.C.M. Gurgel, Poliedros de Grafos Transitivos, Ph.D. Thesis, Instituto de Matemática e Estatística da Universidade de Saõ Paulo, Saõ Paulo, Brazil, 1992
15. Koppen M. Random utility representation of binary choice probabilities: critical graphs yielding critical necessary conditions Journal of Mathematical Psychology 39 1995 21-39
16. Lawler E.L. Lenstra J.K. Rinnooy Kan A.H.G. Shmoys D.B. (Eds.), The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization 1985 Wiley New York
17. McConnell R.M. Spinrad J.P. Modular decompositions and transitive orientations Discrete Mathematics 201 1999 189-241
18. R. Müller, Bounds for Linear VLSI Problems, Ph.D. Thesis, Fachbereich Mathematik, Technische Universität, Berlin, Germany, 1993
19. Müller R. On the partial order polytope of a digraph Mathematical Programming 73A 1 1996 31-49
20. Müller R. Schulz A.S. Transitive packing In McCormick S.T. Queyranne M. (Eds.), Integer Programming and Combinatorial Optimization Lecture Notes in Computer Science vol. 1084 1996 430-444 Proceedings of the 5th International IPCO Conference
21. Naddef D. Pulleyblank W.R. Hamiltonicity and combinatorial polyhedra Journal of Combinatorial Theory, Series B 31 1981 297-312
22. Reinelt G. A note on small linear-ordering polytopes Discrete and Computational Geometry 10 1993 67-78
23. H.P. Young, On permutations and permutation polytopes, Mathematical Programming Study 8 (1978).