[ΒΙΒΛΙΟ][B] Geometry of isotropic convex bodies

S Brazitikos, A Giannopoulos, P Valettas, BH Vritsiou - 2014 - books.google.com
The study of high-dimensional convex bodies from a geometric and analytic point of view,
with an emphasis on the dependence of various parameters on the dimension stands at the …

Lectures on 0/1-polytopes

GM Ziegler - Polytopes—combinatorics and computation, 2000 - Springer
These lectures on the combinatorics and geometry of Oil-polytopes are meant as an
introduction and invitation. Rather than heading for an extensive survey on Oil-polytopes I …

Approximation of convex sets by polytopes

EM Bronstein - Journal of Mathematical Sciences, 2008 - Springer
Approximation of convex sets by polytopes | SpringerLink Skip to main content Advertisement
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Journal of …

What is known about unit cubes

C Zong - Bulletin of the American Mathematical Society, 2005 - ams.org
Unit cubes, from any point of view, are among the simplest and the most important objects in
$ n $-dimensional Euclidean space. In fact, as one will see from this survey, they are not …

[ΒΙΒΛΙΟ][B] The Cube-A Window to Convex and Discrete Geometry

C Zong - 2006 - books.google.com
Eight topics about the unit cubes are introduced within this textbook: cross sections,
projections, inscribed simplices, triangulations, 0/1 polytopes, Minkowski's conjecture …

[ΒΙΒΛΙΟ][B] On linear programming, integer programming and cutting planes

DG Espinoza - 2006 - search.proquest.com
“These problems occur in everyday life; they run the gamut from some very simple situations
that confront an individual to those connected with the national economy as a whole …

Bounds on the Chvátal rank of polytopes in the 0/1-cube

F Eisenbrand, AS Schulz - Combinatorica, 2003 - Springer
Gomory's and Chvátal's cutting-plane procedure proves recursively the validity of linear
inequalities for the integer hull of a given polyhedron. The Chvátal rank of the polyhedron is …

On 0-1 polytopes with many facets

I Bárány, A Pór - Advances in Mathematics, 2001 - Elsevier
On 0- 1 Polytopes with Many Facets Page 1 Advances in Mathematics 161, 209 228 (2001) On
0-1 Polytopes with Many Facets Imre Barany1 Renyi Institute of Mathematics, Hungarian …

Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes

T Christof, G Reinelt - International Journal of Computational …, 2001 - World Scientific
A convex polytope can either be described as convex hull of vertices or as solution set of a
finite number of linear inequalities and equations. Whereas both representations are …

Bounds on the Chvátal rank of polytopes in the 0/1-cube

F Eisenbrand, AS Schulz - … 7th International IPCO Conference Graz, Austria …, 1999 - Springer
Gomory's and Chvátal's cutting-plane procedure proves recursively the validity of linear
inequalities for the integer hull of a given polyhedron. The number of rounds needed to …