Determining the automorphism group of the linear ordering polytope

Discrete Applied Mathematics

Volumn 112, Issue 1-3, 2001, Pages 121-128

  Fiorini, Samuel ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Automorphism group; Facets; Linear ordering polytope

Indexed keywords

EID: 0035885331     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00312-7     Document Type: Article

References (15)

1. G. Bolotashvili, M. Kovalev, E. Girlich, New facets of the linear ordering polytope, SIAM J. Discrete Math. 12 (1999) 326-336.
2. T. Christof, G. Reinelt, Low-dimensional linear ordering polytopes, Technical report, Institut für Angewandte Mathematik, Universität Heidelberg, 1997.
3. Doignon J.-P., Regenwetter M. An approval-voting polytope for linear orders. J. Math. Psych. 41:1997;171-188.
4. J.-P. Doignon, M. Regenwetter, On the combinatorial structure of the approval-voting polytope, Department of Mathematics, Université Libre de Bruxelles, 1999, in preparation.
5. S. Fiorini, On the partial order polytope, preprint, Department of Mathematics, Université Libre de Bruxelles, 1998.
6. Fraleigh J.B. A First Course in Abstract Algebra. 1994;Addison-Wesley, Reading.
7. E. Girlich, M. Kovalev , V. Nalivaiko, A note on an extension of facet-defining digraphs, preprint 23/98, Faculty of Mathematics, Universität Magdeburg, 1998.
8. Goemans M.X., Hall L.A. The strongest facets of the acyclic subgraph polytope are unknown. Cunningham W.H., McCormick S.T., Queyranne M. Integer Programming and Optimization. Lecture Notes in Computer Science 1084. 1996;415-429 Springer, Berlin.
9. Grötschel M., Jünger M., Reinelt G. Acyclic subdigraph and linear orderings: polytopes, facets and a cutting plane algorithm. Rival I. Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and Its Applications. NATO ASI Series C: Mathematical and Physical Sciences. Vol. 147:1985;217-264 Reidel, Dordrecht.
10. Koppen M. Random utility representation of binary choice probabilities: Critical graphs yeilding critical necessary conditions. J. Math. Psych. 19:1995;21-39.
11. Leung J., Lee J. More facets from fences for linear ordering and acyclic subgraph polytope. Discrete Appl. Math. 50:1994;185-200.
12. R. Müller, A.S. Schulz, The interval order polytope of a digraph, in: Integer Programming and Combinatorial Optimization, eds. E. Balas and J. Clausen, Lecture Notes in Computer Science 920, Springer, Berlin, 1995, pp. 50-64.
13. Reinelt G. The Linear Ordering Problem: Algorithms and Applications, Number 8 in Research and exposition in mathematics. 1985;Heldermann Verlag, Berlin.
14. Reinelt G. A note on small linear-ordering polytopes. Discrete Comput. Geom. 10:1993;67-78.
15. Ziegler G.M. Lectures on Polytopes. 1995;Springer, Berlin.