A combinatorial study of partial order polytopes

Authors:
Samuel Fiorini
Affiliations:
Département de Mathématique, Université Libre de Bruxelles, CP 215, Boulevard du Triomphe, 1050 Brussels, Belgium
Venue:
European Journal of Combinatorics
Year:
2003

Citing 9
Cited 1

Random utility representation of binary choice probabilities: critical graphs yielding critical necessary conditions

Journal of Mathematical Psychology
On the partial order polytope of a digraph

Mathematical Programming: Series A and B
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
New Facets of the Linear Ordering Polytope

SIAM Journal on Discrete Mathematics
Determining the automorphism group of the linear ordering polytope

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Facets of the Weak Order Polytope Derived from the Induced Partition Projection

SIAM Journal on Discrete Mathematics
Transitive Packing

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Facets of linear signed order polytopes

Discrete Applied Mathematics

How to recycle your facets

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

To each finite set with at least two elements, there corresponds a partial order polytope. It is defined as the convex hull of the characteristic vectors of all partial orders which have that set as ground set. This 0/1-polytope contains the linear ordering polytope as a proper face. The present article deals with the facial structure of partial order polytopes. Our main results are: (i) a proof that the nonadjacency problem on partial order polytopes is NP-complete; (ii) a characterization of the polytopes that are affinely equivalent to a face of some partial order polytope.