Lectures on 0/1-Polytopes
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 1-41
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- A Lower Bound for the Simplexity of then-Cube via Hyperbolic VolumesEuropean Journal of Combinatorics, 2000
- Upper Bounds on the Maximal Number of Facets of 0/1-PolytopesEuropean Journal of Combinatorics, 2000
- On the Volume of the Polytope of Doubly Stochastic MatricesExperimental Mathematics, 1999
- Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable HypergraphsJournal of Combinatorial Theory, Series A, 1997
- All 0–1 polytopes are traveling salesman polytopesCombinatorica, 1996
- Gröbner bases and triangulations of the second hypersimplexCombinatorica, 1995
- The cut cone III: On the role of triangle facetsGraphs and Combinatorics, 1993
- The cut polytope and the Boolean quadric polytopeDiscrete Mathematics, 1990
- On the probability that the determinant of an n x n matrix over a finite field vanishesDiscrete Mathematics, 1984
- Determinants Whose Elements Are 0 and 1The American Mathematical Monthly, 1946