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

combinatorial optimizationconvex polytope0/1-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

(45)

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

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)