Extremal properties of 0/1-polytopes

Discrete and Computational Geometry

Volumn 17, Issue 4, 1997, Pages 439-448

  Kortenkamp, U H ^a   Richter Gebert, J ^a   Sarangarajan, A ^b,c   Ziegler, G M ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031526966     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009303     Document Type: Article

References (13)

1. N. Amenta and G. M. Ziegler: Deformed products and maximal shadows, Preprint 502/1996, TU Berlin, March 1996, 32 pages.
2. F. Barahona and A. R. Mahjoub: On the cut polytope, Math. Programming 36 (1986), 136-157.
3. L. J. Billera and A. Sarangarajan: All 0-1 polytopes are traveling salesman polytopes, Combinatorica 16 (1996), 175-188.
4. K. H. Borgwardt: The Simplex Method. A Probabilistic Analysis, Algorithms and Combinatorics, Vol. 1, Springer-Verlag, Berlin, 1987.
5. T. Christof, M. Jünger, and G. Reinelt: A complete description of the traveling salesman polytope on 8 nodes, Oper. Res. Lett. 10 (1991), 497-500.
6. P. Erdos and P. Turán: On a problem of Sidon in additive number theory, and on some related problems, J. London Math. Soc. 16 (1941), 212-215. Addendum, J. London Math. Soc. 19 (1944), 208.
7. M. Grötschel and M. Padberg: Polyhedral theory/polyhedral computations, in: The Traveling Salesman Problem (E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, D. B. Shmoys, eds.), Wiley, New York 1988, pp. 251-360.
8. M. Henk, J. Richter-Gebert, and G. M. Ziegler: Basic properties of convex polytopes, Preprint 472/1995, TU Berlin, October 1995, 28 pages; CRC Handbook on Discrete and Computational Geometry (J. E. Goodman, J. O'Rourke, eds.), to appear.
9. G. Kalai: The number of faces of centrally-symmetric polytopes (Research Problem), Graphs Combinatorics 5 (1989), 389-391.
10. U. H. Kortenkamp: Small 0/1-polytopes with many facets, http://www.math.tu-berlin.de/ ~hund/01-Olympics.html
11. A. S. Schulz, R. Weismantel, and G. M. Ziegler: 0/1-Integer programming: augmentation and optimization are equivalent, in: Algorithms-ESA '95 (P. Spirakis, ed.), Lecture Notes in Computer Science, Vol. 979, Springer-Verlag, Berlin, 1995, pp. 473-483.
12. T. Thiele: Extremalprobleme für Punktmengen, Diplomarbeit, Freie Universität Berlin, 1991, 80 pages.
13. G. M. Ziegler: Lectures on Polytopes, Graduate Texts in Mathematics, Vol. 152, Springer-Verlag, New York, 1995; Updates, corrections, and more available at http://www.math.tu-berlin.de/~ziegler