Revlex-initial 0/1-polytopes
From MaRDI portal
Publication:2497967
DOI10.1016/j.jcta.2005.07.010zbMath1099.52002arXivmath/0412028OpenAlexW2091068541MaRDI QIDQ2497967
Volker Kaibel, Rafael Gillmann
Publication date: 4 August 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0412028
(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Combinatorial complexity of geometric structures (52C45)
Related Items
Knapsack polytopes: a survey, Convex hull characterizations of lexicographic orderings, Expansion of random 0/1 polytopes, Convex hulls of superincreasing knapsacks and lexicographic orderings, Lexicographical polytopes, On Dantzig figures from graded lexicographic orders, Equivalence classes of full-dimensional 0/1-polytopes with many vertices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on the maximal number of facets of 0/1-polytopes
- Simple 0/1-polytopes
- Lower bound for the maximal number of facets of a 0/1 polytope
- Decompositions of Rational Convex Polytopes
- Lectures on Polytopes
- On the expansion of combinatorial polytopes
- On 0-1 polytopes with many facets