Simple 0/1-polytopes

DOI10.1006/EUJC.1999.0328zbMath0952.52008OpenAlexW1978159628MaRDI QIDQ1964656

Martin Wolff, Volker Kaibel

Publication date: 4 January 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5b1edc117aadb3949f82ffb66913b9a5a972a76c

zbMATH Keywords

hypercube0/1-polytopecartesian product of 0/1-simplicesstar-partition

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Combinatorial optimization (90C27)

Related Items (8)

On permutation polytopes ⋮ The Characteristic Imset Polytope of Bayesian Networks with Ordered Nodes ⋮ Torsionfreeness for divisor class groups of toric rings of integral polytopes ⋮ A lexicographic semiorder polytope and probabilistic representations of choice ⋮ Seminormality, canonical modules, and regularity of cut polytopes ⋮ Revlex-initial 0/1-polytopes ⋮ DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES ⋮ Existence of unimodular triangulations — positive results

Cites Work

• Unnamed Item
• Extremal properties of \(0/1\)-polytopes
• Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
• The Hirsch conjecture is true for (0,1)-polytopes
• Lectures on Polytopes

This page was built for publication: Simple 0/1-polytopes