A combinatorial study of partial order polytopes
From MaRDI portal
Publication:1867280
DOI10.1016/S0195-6698(03)00009-XzbMath1020.52010OpenAlexW2077831283MaRDI QIDQ1867280
Publication date: 2 April 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(03)00009-x
linear ordering polytope3-SAT polytopefacial structure of partial order polytopespartial order polytope
Related Items (6)
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ On affine reducibility of combinatorial polytopes ⋮ The common face of some 0/1-polytopes with NP-complete nonadjacency relation ⋮ How to recycle your facets ⋮ Primary facets of order polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonicity and combinatorial polyhedra
- Induced binary probabilities and the linear ordering polytope: A status report
- Modular decomposition and transitive orientation
- Facets of linear signed order polytopes.
- Set packing relaxations of some integer programs
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- On the partial order polytope of a digraph
- All 0-1 polytopes are traveling salesman polytopes
- A note on small linear-ordering polytopes
- Facets of the Weak Order Polytope Derived from the Induced Partition Projection
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Facets of the linear ordering polytope
- Transitive packing
- New Facets of the Linear Ordering Polytope
- Determining the automorphism group of the linear ordering polytope
This page was built for publication: A combinatorial study of partial order polytopes
