Graphic vertices of the metric polytope

Discrete Mathematics

Volumn 151, Issue 1-3, 1996, Pages 131-153

  Laurent, Monique ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346239869     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00091-V     Document Type: Article

References (19)

1. 1, Publ. Math. Orsay 3 (1982).
2. D. Avis, Extremal metrics induced by graphs, Ann. Discrete Math. 8 (1980) 217-220.
3. D. Avis, On the extreme rays of the metric cone, Canad. J. Math. 32 (1980) 126-144.
4. 1-embeddability, complexity and multicommodity flows, Networks 21 (1991) 595-617.
5. F. Barahona, On cuts and matchings in planar graphs, Math. Programming 60 (1993) 53-68.
6. F. Barahona and A.R. Mahjoub, On the cut polytope, Math. Programming 36 (1986) 157-173.
7. M. Deza and A. Deza, The ridge graph of the metric polytope and some relatives, Rapport LIENS-93-19, Ecole Normale Supérieure, Paris, 1993.
8. M. Deza, V. P. Grishukhin and M. Laurent, The symmetries of the cut polytope and of some relatives, in: P. Gritzman and B. Sturmfels, eds., Applied Geometry and Discrete Mathematics - The Victor Klee Festschrift, Vol. 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (Amer. Math. Soc. 1991) 205-220.
9. M. Deza, M. Laurent and S. Poljak, The cut cone III: on the role of triangle facets, Graphs Combin. 8 (1992) 125-142 (updated version in Graphs Combin. 9 (1993) 135-152).
10. M. Deza, M. Laurent and S. Poljak, The cut cone III: on the role of triangle facets, Graphs Combin. 8 (1992) 125-142 (updated version in Graphs Combin. 9 (1993) 135-152).
11. R. Graham, A. Yao and F. Yao, Information bounds are weak for the shortest distance problem, J. ACM 27 (1980) 428-444.
12. V.P. Grishukhin, Computing extreme rays of the metric cone for seven points, European, J. Combin. 13 (1992) 153-165.
13. M. Grötschel and W.R. Pulleyblank, Weakly bipartite graphs and the max-cut problem, Oper. Res. Lett. 1 (1981) 23-27.
14. M. Laurent and S. Poljak, The metric polytope, in: E. Balas, G. Cornuejols and R. Kannan, eds., Integer Programming and Combinatorial Optimization (Carnegie Mellon University, GSIA, Pittsburgh, 1992) 274-286.
15. M. Laurent and S. Poljak, One-third-integrality in the metric polytope, Math. Programming, to appear.
16. M. V. Lomonossov, On a system of flows in a network (in Russian), Problemy Peredatchi Informatzii 14 (1978) 60-73.
17. M.V. Lomonossov, Combinatorial approaches to multiflow problem, Discrete Appl. Math. 11 (1985) 1-93.
18. M. Padberg, The boolean quadric polytope: some characteristics, facets and relatives. Math. Programming 45 (1989) 139-172.
19. S. Poljak, Polyhedral and eigenvalue approximations of the max-cut problem, in: Sets, Graphs and Numbers, Budapest, 1991, Vol. 60 of Colloquia Mathematica Societatis János Bolyai, 1992.