Applications of cut polyhedra

In this paper and in its continuation (Part II, this issue), we group, within a unified framework, many applications of the following polyhedra: cut, boolean quadric, hypermetric and metric polyhedra. We treat, in particular, the following applications: . 8,and I,,-metrics in functional analysis, l the max-cut problem, the Boole problem and multicommodity flow problems in combinatorial optimization, l lattice holes in geometry of numbers, . density matrices of many-fermions systems in quantum mechanics. We present some other applications, in probability theory, statistical data analysis and design theory. In this first part, after introducing the main definitions and operations for cut polyhedra, we describe the connections with [i-metrics and with other metric properties, and we consider, in particular, the applications to some classes of metrics arising from graphs, normed spaces and lattices.

[1]  I. J. Schoenberg.  Metric spaces and completely monotone functions , 1938 .

[2]  I. J. Schoenberg,et al.  Metric spaces and positive definite functions , 1938 .

[3]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[4]  E. Davidson.  Linear Inequalities for Density Matrices , 1969 .

[5]  Ronald L. Graham,et al.  On the addressing problem for loop switching , 1971 .

[6]  R. P. Kurshan,et al.  On the addressing problem of loop switching , 1972 .

[7]  D. Djoković.  Distance-preserving subgraphs of hypercubes , 1973 .

[8]  Ian F. Blake,et al.  Addresses for graphs , 1973, IEEE Trans. Inf. Theory.

[9]  B. Bollobás.  Surveys in Combinatorics , 1979 .

[10]  David Avis.  Extremal Metrics Induced by Graphs , 1980 .

[11]  D. Avis.  On the Extreme Rays of the Metric Cone , 1980, Canadian Journal of Mathematics.

[12]  David Avis,et al.  Hypermetric Spaces and the Hamming Cone , 1981, Canadian Journal of Mathematics.

[13]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[14]  Patrice Assouad.  Sur les Inégalités Valides dans L1 , 1984, Eur. J. Comb..

[15]  R. Graham,et al.  Isometric embeddings of graphs. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[16]  On graphs which are metric spaces of negative type0 , 1985 .

[17]  Peter Winkler,et al.  Collapse of the Metric Hierarchy for Bipartite Graphs , 1986, Eur. J. Comb..

[18]  I. Pitowsky.  The range of quantum probability , 1986 .

[19]  Charles R. Johnson,et al.  The structure of distances in networks , 1986, Networks.

[20]  Francisco Barahona,et al.  On the cycle polytope of a binary matroid , 1986, J. Comb. Theory, Ser. B.

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

[22]  A. D. Gordon.  A Review of Hierarchical Classification , 1987 .

[23]  Pierre Baldi,et al.  Embeddings of ultrametric spaces in finite dimensional structures , 1987 .

[24]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[25]  R. Alexander.  Zonoid theory and Hilbert's fourth problem , 1988 .

[26]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[27]  David Avis,et al.  All the Facets of the Six-point Hamming Cone , 1989, Eur. J. Comb..

[28]  Michel Deza,et al.  New Results on Facets of the Cut Cone , 1990, Conference on Integer Programming and Combinatorial Optimization.

[29]  Noga Alon.  The CW-Inequalities for Vectors in l1 , 1990, Eur. J. Comb..

[30]  THE FIBONACCI AND PARACHUTE INEQUALITIES FOR ^ -METRICS , 1990 .

[31]  Michel Deza,et al.  The Symmetries of the Cut Polytope and of Some Relatives , 1990, Applied Geometry And Discrete Mathematics.

[32]  Caterina De Simone,et al.  The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[33]  David Avis.  On the Complexity of Isometric Embedding in the Hypercube , 1990, SIGAL International Symposium on Algorithms.

[34]  Caterina De Simone.  Lifting facets of the cut polytope , 1990 .

[35]  Viatcheslav P. Grishukhin.  All Facets of the Cut Cone Cn for n = 7 are Known , 1990, Eur. J. Comb..

[36]  Hans-Jürgen Bandelt.  Recognition of Tree Metrics , 1990, SIAM J. Discret. Math..

[37]  Itamar Pitowsky,et al.  Correlation polytopes: Their geometry and complexity , 1991, Math. Program..

[38]  P. Gritzmann,et al.  Applied geometry and discrete mathematics : the Victor Klee festschrift , 1991 .

[39]  David Avis,et al.  The cut cone, L1 embeddability, complexity, and multicommodity flows , 1991, Networks.

[40]  Wei-Min Liu,et al.  The cone of distance matrices , 1991 .

[41]  Michel Deza,et al.  Facets for the cut cone I , 1992, Math. Program..

[42]  Ingo Althöfer,et al.  An "average distance" inequality for large subsets of the cube , 1992, J. Comb. Theory, Ser. B.

[43]  Martin Grötschel,et al.  Clique-Web Facets for Multicut Polytopes , 1992, Math. Oper. Res..

[44]  Michel Deza,et al.  Extension operations for cuts , 1992, Discret. Math..

[45]  Viatcheslav Grishukhin.  Computing extreme rays of the metric cone for seven points , 1992, Eur. J. Comb..

[46]  S. Poljak,et al.  One-third-integrality in the metric polytope , 1992 .

[47]  Michel Deza,et al.  The cut cone III: On the role of triangle facets , 1992, Graphs Comb..

[48]  Monique Laurent,et al.  The Metric Polytope , 1992, Conference on Integer Programming and Combinatorial Optimization.

[49]  Michel Deza,et al.  Extreme hypermetrics and L-polytopes , 1992 .

[50]  Svatopluk Poljak,et al.  Max-cut in circulant graphs , 1992, Discret. Math..

[51]  Komei Fukuda,et al.  Antipodal graphs and oriented matroids , 1993, Discret. Math..

[52]  M. Deza,et al.  The hypermetric cone is polyhedral , 1993, Comb..

[53]  M. Laurent,et al.  Hypermetric graphs , 1993 .

[54]  Sergey V. Shpectorov,et al.  On Scale Embeddings of Graphs into Hypercubes , 1993, Eur. J. Comb..

[55]  Endre Boros,et al.  Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions , 1993, Math. Oper. Res..

[56]  J. Kahn,et al.  A counterexample to Borsuk's conjecture , 1993, math/9307229.

[57]  Michel Deza,et al.  The inequicut cone , 1993, Discret. Math..

[58]  Michel Deza,et al.  The even and odd cut polytopes , 1993, Discret. Math..

[59]  Francisco Barahona,et al.  On cuts and matchings in planar graphs , 1993, Math. Program..

[60]  András Sebö,et al.  On the geodesic-structure of graphs: a polyhedral approach to metric decomposition , 1993, IPCO.

[61]  András Sebö,et al.  A generalized cut-condition for multiflows in matroids , 1993, Discret. Math..

[62]  Caterina De Simone,et al.  Collapsing and lifting for the cut cone , 1994, Discret. Math..

[63]  Robert Milewski,et al.  Algebraic Lattices , 1994 .

[64]  Michel Deza,et al.  Applications of cut polyhedra—II , 1994 .