论文信息 - Extremal Properties of 0/1-Polytopes

Extremal Properties of 0/1-Polytopes

Abstract. We provide lower and upper bounds for the maximal number of facets of a d-dimensional 0/1-polytope, and for the maximal number of vertices that can appear in a two-dimensional projection (``shadow'') of such a polytope.

[1] K. Borgwardt. The Simplex Method: A Probabilistic Analysis , 1986 .

[2] Louis J. Billera,et al. All 0–1 polytopes are traveling salesman polytopes , 1996, Comb..

[3] Andreas S. Schulz,et al. 0/1-Integer Programming: Optimization and Augmentation are Equivalent , 1995, ESA.

[4] G. Ziegler,et al. Basic properties of convex polytopes , 1997 .

[5] Gil Kalai,et al. The number of faces of centrally-symmetric polytopes , 1989, Graphs Comb..

[6] G. Ziegler. Lectures on Polytopes , 1994 .

[7] K. Borgwardt. The Simplex Method , 1987 .

[8] P. Erdös,et al. On a problem of sidon in additive number theory, and on some related problems , 1941 .

[9] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .

[10] P. Erdös. On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum , 1944 .

[11] Michael Jünger,et al. A complete description of the traveling salesman polytope on 8 nodes , 1991, Oper. Res. Lett..

[12] Ali Ridha Mahjoub,et al. On the cut polytope , 1986, Math. Program..