scientific article; zbMATH DE number 1538119

MaRDI QIDQ4518979zbMATH OpenFDO

Authors Günter M. Ziegler

Publication date 21 August 2001

Full work available at URL https://arxiv.org/abs/math/9909177

zbMATH Keywords

0/1-polytopecombinatorial optimizationconvex polytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• Simple 0/1-polytopes
• The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
• scientific article; zbMATH DE number 1538123
• 0/1-Polytopes. Typical and extremal properties
• Upper bounds on the maximal number of facets of 0/1-polytopes

Cited in

(49)

• A general computer program for the Bell detection loophole
• Cut polytope has vertices on a line
• Lower bounds for the simplexity of the n-cube
• On the geometry of discrete exponential families with application to exponential random graph models
• Simple 0/1-polytopes
• Characterizations of democratic systems of translates on locally compact abelian groups
• Connectivity of cubical polytopes
• Strong IP formulations need large coefficients
• Foundations of space-time finite element methods: polytopes, interpolation, and integration
• Short simplex paths in lattice polytopes
• On a recognition problem on cut polytope relaxations
• On permutation polytopes: notions of equivalence
• Matroids from hypersimplex splits
• Some \(0/1\) polytopes need exponential size extended formulations
• Smallest singular value of random matrices and geometry of random polytopes
• Revlex-initial 0/1-polytopes
• How to recycle your facets
• Equivalence classes of full-dimensional 0/1-polytopes with many vertices
• Approximation of convex sets by polytopes
• Around Borsuk's hypothesis
• A polyhedral study of lifted multicuts
• Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
• Hepp's bound for Feynman graphs and matroids
• The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
• Rank of random half-integral polytopes. Extended abstract
• The degree of a tropical basis
• A continuous analog for 4-dimensional objects
• Hierarchical Models, Marginal Polytopes, and Linear Codes
• Extremal edge polytopes
• Lectures on Polytopes
• A lexicographic semiorder polytope and probabilistic representations of choice
• What is known about unit cubes
• Weights of exact threshold functions
• Random polytopes obtained by matrices with heavy-tailed entries
• Pivot rules for circuit-augmentation algorithms in linear optimization
• On 0-1 polytopes with many facets
• Doubly random polytopes
• On the bond polytope
• Expansion of random 0/1 polytopes
• Incoherent majorities: the McGarvey problem in judgement aggregation
• Face enumeration for split matroid polytopes
• Set-membership estimation for nonlinear systems based on zonotope analysis
• On the edge expansion of random polytopes
• Enumerating the faces of split matroid polytopes
• On the existence of 0/1 polytopes with high semidefinite extension complexity
• On permutation polytopes
• Permutation polytopes and indecomposable elements in permutation groups
• Approximating polyhedra with sparse inequalities
• Many 2-level polytopes from matroids

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518979)