Applications of cut polyhedra - I

Journal of Computational and Applied Mathematics

Volumn 55, Issue 2, 1994, Pages 191-216

  Deza, Michel ^a   Laurent, Monique ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Correlation of events; Cut; Graphic metric; Hypermetric; Isometric embedding; Lattice; Measure space; Polyhedron; Ultrametric; Valid inequality; 1 metric

Indexed keywords

EID: 43949159452     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-0427(94)90020-5     Document Type: Article

References (103)

1. Zonoid theory and Hilbert's fourth problem
2. 1
3. An “average distance” inequality for large subsets of the cube
4. Embeddings of ultrametric spaces in finite dimensional structures
5. Produit tensoriel, distances extrémales et réalisation de covariances
6. Produit tensoriel, distances extrémales et réalisation de covariances
7. 1: aspect analytique
8. 1 et inégalités hypermétriques
9. 1
10. 1
11. Espaces métriques plongeables dans un hypercube: aspects combinatoires
12. 1
13. Extremal metrics induced by graphs
14. On the extreme rays of the metric cone
15. Hypermetric spaces and the Hamming cone
16. On the complexity of isometric embedding in the hypercube
17. 1-embeddability, complexity and multicommodity flows
18. A bound on the k-gonality of the hypermetric cone and related complexity problems
19. All facets of the six point Hamming cone
20. Recognition of tree metrics
21. 5
22. On cuts and matchings in planar graphs
23. On the cycle polytope of a binary matroid
24. An application of combinatorial optimization to statistical physics and circuit layout design
25. On the cut polytope
26. Characterization of derived graphs
27. Addresses for graphs
28. Cut polytopes boolean quadratic polytopes and nonnegative quadratic pseudo-boolean functions
29. p
30. Algebraic lattices
31. The equipartition polytope: part I
32. The equipartition polytope: part II
33. On the Hamming geometry of unitary cubes
34. Matrices de formes quadratiques non négatives pour des arguments binaires
35. The inequicut cone
36. L-polytopes and equiangular lines
37. Hypermetric graphs
38. The symmetries of the cut polytope and of some relatives
39. Extreme hypermetrics and L-polytopes
40. The hypermetric cone is polyhedral
41. Clique-web facets for multicut polytopes
42. Applications of cut polyhedra — II
43. A survey of the known facets of the cut cone
44. Extension operations for cuts
45. Facets for the cut cone I
46. Facets for the cut cone II clique-web facets
47. New results on facets of the cut cone
48. 1-metrics
49. The cut cone: simplicial faces and linear dependencies
50. The even and odd cut polytopes
51. 1-rigid graphs
52. Hypercube embedding of generalized bipartite metrics
53. The cut cone III: on the role of triangle facets
54. Distance preserving subgraphs of hypercubes
55. Representability conditions
56. Antipodal graphs and oriented matroids
57. A review of hierarchical classification
58. On the addressing problem for loop switching
59. On isometric embeddings of graphs
60. n for n = 7 are known
61. Computing extreme rays of the metric cone for seven points
62. Some network flow problems solved with pseudo-boolean programming
63. The cone of distance matrices
64. The relation between hierarchical and classical models for psychological distances
65. The structure of distances in networks
66. A counterexample to Borsuk's conjecture
67. Metric inequalities and symmetric differences
68. Hypermetric spaces
69. On metric properties of regular graphs
70. The metric polytope
71. On the geodesic-structure of graphs: a polyhedral approach to metric decomposition
72. On a system of flows in a network
73. Combinatorial approaches to multiflow problems
74. Linear inequalities for density matrices II
75. The boolean quadric polytope: some characteristics, facets and relatives
76. The range of quantum probability
77. Correlation polytopes their geometry and complexity
78. On a facet of the balanced subgraph polytope
79. Max-cut in circulant graphs
80. Collapse of the metric hierarchy for bipartite graphs
81. Zonoids and related topics
82. Metric spaces and completely monotone functions
83. Metric spaces and positive definite functions
84. On scale embeddings of graphs into hypercubes
85. The cut polytope and the boolean quadric polytope
86. Lifting facets of the cut polytope
87. Collapsing and lifting for the cut cone
88. Some new classes of facets for the equicut polytope
89. Classification of finite connected hypermeteric spaces
90. On graphs which are metric spaces of negative type
91. The metric structure of graphs: theory and applications
92. A combinatorial approach to the diagonal N-representability problem