scientific article; zbMATH DE number 1538119
From MaRDI portal
Publication:4518979
zbMATH Open0966.52012arXivmath/9909177MaRDI QIDQ4518979FDOQ4518979
Publication date: 21 August 2001
Full work available at URL: https://arxiv.org/abs/math/9909177
Title of this publication is not available (Why is that?)
Recommendations
Cited In (46)
- Rank of random half-integral polytopes. Extended abstract
- A general computer program for the Bell detection loophole
- On permutation polytopes
- Revlex-initial 0/1-polytopes
- Permutation polytopes and indecomposable elements in permutation groups
- Matroids from hypersimplex splits
- Incoherent majorities: the McGarvey problem in judgement aggregation
- Extremal edge polytopes
- Cut polytope has vertices on a line
- On the geometry of discrete exponential families with application to exponential random graph models
- Characterizations of democratic systems of translates on locally compact abelian groups
- Short simplex paths in lattice polytopes
- On 0-1 polytopes with many facets
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
- What is known about unit cubes
- Strong IP formulations need large coefficients
- A lexicographic semiorder polytope and probabilistic representations of choice
- Foundations of space-time finite element methods: polytopes, interpolation, and integration
- Doubly random polytopes
- On a recognition problem on cut polytope relaxations
- On the existence of 0/1 polytopes with high semidefinite extension complexity
- Approximation of convex sets by polytopes
- Approximating polyhedra with sparse inequalities
- A polyhedral study of lifted multicuts
- Around Borsuk's hypothesis
- The degree of a tropical basis
- Random polytopes obtained by matrices with heavy-tailed entries
- Connectivity of cubical polytopes
- Many 2-level polytopes from matroids
- Simple 0/1-polytopes
- Equivalence classes of full-dimensional 0/1-polytopes with many vertices
- A continuous analog for 4-dimensional objects
- Lectures on Polytopes
- How to recycle your facets
- Hierarchical Models, Marginal Polytopes, and Linear Codes
- Smallest singular value of random matrices and geometry of random polytopes
- Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
- Some \(0/1\) polytopes need exponential size extended formulations
- Hepp's bound for Feynman graphs and matroids
- Weights of exact threshold functions
- Enumeration of 2-level polytopes
- Expansion of random 0/1 polytopes
- Lower bounds for the simplexity of the \(n\)-cube
- On permutation polytopes: notions of equivalence
- On the bond polytope
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)
