See this document in CiteSeerX!

Lectures on 0/1-Polytopes (1999)  (Make Corrections)  (97 citations)
Günter M. Ziegler



  Home/Search   Context   Related

 
View or download:
math.tuberlin.de/pu...067zeroone.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  math.tuberlin.de/~zi...index.old (more)
Homepages:  G.Ziegler  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: These lectures on the combinatorics and geometry of 0=1-polytopes are meant as an introduction and invitation. Rather than heading for an extensive survey on 0=1polytopes I present some interesting aspects of these objects (Update)

Similar documents based on text:   More   All
0.7:   Lectures on 0/1-Polytopes - Ziegler (1999)   (Correct)
0.6:   Lectures on Polytopes: Updates, Corrections, and More - Ziegler (1999)   (Correct)
0.5:   Bi-Annual Report 1997/1998: Methods of Combinatorial Geometry - Ziegler   (Correct)

Related documents from co-citation:   More   All
12:   The Maximum Numbers of Faces of a Convex Polytope (context) - McMullen - 1970
11:   American Mathematical Society (context) - Sturmfels, Convex et al. - 1995
11:   Theory of Linear and Integer Programming (context) - Schrijver - 1986

BibTeX entry:   (Update)

G.M. Ziegler, Lectures on Polytopes, Springer--Verlag, 1994. http://citeseer.ist.psu.edu/ziegler99lectures.html   More

@book{ ziegler95lectures,
    author = "G{\"u}nter M. Ziegler",
    title = "Lectures on Polytopes",
    publisher = "Springer-Verlag",
    address = "Berlin",
    isbn = "038794365X",
    year = "1995",
    url = "citeseer.ist.psu.edu/ziegler99lectures.html" }
Citations (may not include all citations):
85   Wiley-Interscience Series in Discrete Mathematics and Optimi.. (context) - Schrijver, Linear et al. - 1986
31   Schrijver: Geometric Algorithms and Combinatorial Optimizati.. (context) - Gr, Lov - 1988
28   Discrete Math (context) - Mukhopadhyay, probability et al. - 1984
17   Algorithms and Combinatorics (context) - Deza, Laurent et al. - 1997
15   Discrete Math (context) - De Simone, polytope et al. - 1989
9   atal rank of polytopes in the 0=1-cube (context) - Bockmayr, Eisenbrand et al.
8   Joswig: Polymake: a framework for analyzing convex polytopes (context) - Gawrilow
6   Blind: Convex polytopes without triangular faces (context) - Blind - 1990
5   as: Random Graphs (context) - Bollob - 1985
4   obner bases and triangulations of the second hypersimplex (context) - De Loera, Sturmfels et al. - 1995
4   Discrete Comput (context) - Elekes, inequality et al. - 1986
4   Anderson: Simplexity of the cube (context) - Hughes - 1996
4   Combinatorial Theory (context) - Odlyzko, spanned et al. - 1988
3   Program in Applied and Computational Mathematics (context) - Smith, Computational et al. - 1988
3   Anderson: A triangulation of the 6-cube with 308 simplices (context) - Hughes
3   Discrete Comput (context) - Haiman, simple et al. - 1991
3   Mihail: Balanced matroids (context) - Feder - 1992
3   Cook: On the solution of traveling salesman problems (context) - Applegate, Bixby et al. - 1998
2   Mahjoub: On the cut polytope (context) - Barahona - 1986
2   Richter-Gebert: Minimal simplicial dissections and triangula.. (context) - Below, Brehm et al. - 1999
2   atal: Edmonds polytopes and a hierarchy of combinatorial pro.. (context) - Chv - 1973
2   Sarangarajan: All 0-1 polytopes are travelling salesman poly.. (context) - Billera - 1996
2   Wiley-Interscience (context) - Muroga, Logic et al. - 1971
2   matrices with vanishing determinants (context) - Metropolis, Stein et al. - 1967
2   Aurenhammer: Classifying hyperplanes in hypercubes (context) - Aichholzer - 1996
2   os: On the determinant (context) - Koml - 1967
2   Klee: A proof of the strict monotone 4-step conjecture (context) - Holt - 1998
2   TU Berlin (context) - Riedel, Chv et al. - 1999
2   and indecomposable hypergraphs (context) - Alon, Anti-Hadamard et al. - 1997
2   cubes: Some relatives of the Hadamard maximum determinant pr.. (context) - Hudelson, Klee et al. - 1996
2   Robbins: On the volume of the polytope of doubly stochastic .. (context) - Chan
1   Ziegler: Extremal properties of 0=1-polytopes (context) - Kortenkamp, Richter-Gebert et al. - 1997
1   Padberg Polyhedral TheoryPolyhedral Computation (context) - Padberg, Polyhedral et al. - 1988
1   Radcliffe: The maximum determinant of 1 matrices (context) - Neubauer - 1997
1   Diplomarbeit am Institut fur Grundlagen der Informationsver.. (context) - Aichholzer, Huperkuben et al. - 1992
1   Extremal problems for determinants (context) - Szekeres, Tur - 1940
1   edi: On the probability that a random 1-matrix is singular (context) - Kahn, Koml et al. - 1995
1   SpringerVerlag New York Berlin Heidelberg 1995; Updates (context) - Ziegler, Polytopes et al. - 1995
1   Zeller: Binare Matrizen (context) - Ehlich - 1962
1   Schulz: Bounds of the Chvatal rank of polytopes in the 0/1 .. (context) - Eisenbrand
1   Wolff: Simple 0=1-polytopes (context) - Kaibel - 1999
1   Poljak: The cut cone III: On the role of triangle facets (context) - Deza, Laurent - 1993
1   Rote: Upper bounds on the maximal number of facets of 0=1-po.. (context) - Fleiner, Kaibel - 1999
http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/SMAPO/SMAPO.html
http://www.imrryr.org/
http://www.math.tu-berlin.de/diskregeom/polymake/doc/



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.math.tu-berlin.de/~ziegler/index.old.html):
Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk .. - Ziegler   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC