On skeletons, diameters and volumes of metric polyhedra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1120, Issue , 1996, Pages 112-128

  Deza, Antoine ^a   Deza, Michel ^b   Fukuda, Komei ^c,d  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c ETH ZURICH   (Switzerland)

^d UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GEOMETRY; QUANTUM THEORY;

ADJACENCY RELATIONS; COMBINATORIAL PROPERTIES; DOUBLE DESCRIPTION; EDGE CONNECTIVITY; FACE LATTICE; LIFTING PROCEDURES; MULTICOMMODITY FLOW PROBLEMS; SYMMETRY GROUPS;

MUSCULOSKELETAL SYSTEM;

EID: 0038342880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61576-8_78     Document Type: Conference Paper

References (31)

1. Assouad P. and Deza M.: Metric subspaces of L 1. Publications mathématiques d’Orsay 3 (1982)
2. Avis D.: On the extreme rays of the metric cone. Canadian Journal of Mathematics XXXII 1 (1980) 126-144
3. Avis D.: In H. Imai ed. RIMS Kokyuroku A C Implementation of the Reverse Search Vertex Enumeration Algorithm. 872 (1994)
4. Avis D., Bremmer D. and Seidel R.: How good are convex hall algorithms. Computational Geometry: Theory and Applications (to appear)
5. Avis D. and Deza A.: Solitaire Cones. (in preparation)
6. Balinski M.: On the graph structure of convex polyhedra in n-space. Pacific Journal of Mathematics 11 (1961) 431-434
7. Barahona F. and Mahjoub R.: On the cut polytope. Mathematical Programming 36 (1986) 157-173
8. Bayer M. and Lee C.: Combinatorial aspects of convex polytopes. In P. Gruber and J. Wills eds. Handbook on Convex Geometry North Holland (1994) 485-534
9. Brouwer A., Cohen A. and Neumaier A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)
10. Christof T. and Reinelt G.: Combinatorial optimization and small polytopes. To appear in Spanish Statistical and Operations Research Society 3 (1996)
11. Christof T. and Reinelt G.: Computing linear descriptions of combinatorial polytopes. (in preparation)
12. Deza A.: Metric polyhedra combinatorial structure and optimization. (in preparation)
13. Deza A. and Deza M.: The ridge graph of the metric polytope and some relatives. In T. Bisztriczky, P. McMullen, R. Schneider and A. Ivic Weiss eds. Polytopes: Abstract, Convex and Computational (1994) 359-372
14. Deza A. and Deza M.: The combinatorial structure of small cut and metric polytopes. In T. H. Ku ed. Combinatorics and Graph Theory, World Scientific Singapore (1995) 70-88
15. Deza M., Grishukhin V. and Laurent M.: The symmetries of the cut polytope and of some relatives. In P. Gritzmann and P Sturmfels eds. Applied Geometry and Discrete Mathematics, the "Victor Klee Festschrift" DIMACS Series in Discrete Mathematics and Theoretical Computer Silence 4 (1991) 205-220
16. Deza M. and Laurent M.: Facets for the cut cone I. Mathematical Programming 56 (2) (1992) 121-160
17. Deza M. and Laurent M.: Applications of cut polyhedra. Journal of Computational and Applied Mathematics 55 (1994) 121-160 and 217:247
18. Deza M. and Laurent M.: New results on facets of the cut cone. R.C. Bose memorial issue of Journal of Combinatorics, Information and System Sciences 17 (1-2) (1992) 19-38
19. Deza M., Laurent M. and Poljak S.: The cut cone III: on the role of triangle facets. Graphs and Combinatorics 8 (1992) 125-142
20. Fukuda K.: cdd reference manual, version 0.56. ETH Zentrum, Zürich, Switzerland (1995)
21. Grishukhin V. P.: Computing extreme rays of the metric cone for seven points. European Journal of Combinatorics 13 (1992) 153-165
22. Iri M.: On an extension of maximum-flow minimum-cut theorem to multicommodity flows. Journal of the Operational Society of Japan 13 (1970-1971) 129-135
23. Laurent M.: Graphic vertices of the metric polytope. Discrete Mathematics 145 (1995) (to appear)
24. Laurent M. and Poljak S.: The metric polytope. In E. Balas, G. Cornuejols and R. Kannan eds. Integer Programming and Combinatorial Optimization Carnegie Mellon University, GSIA, Pittsburgh (1992) 274-28
25. Murty K. G. and Chung S. J.: Segments in enumenating faces. Mathematical Programming 70 (1995) 27-45
26. Onaga K. and Kakusho O.: On feasibility conditions of multicommodity flows in networks. IEEE Trans. Circuit Theory 18 (1971) 425-429
27. Padberg M.: The boolean quadric polytope: some characteristics, facets and relatives. Mathemktical Programming 45 (1989) 139-172
28. Plesnik J.: Critical graphs of given diameter. Acta Math. Univ. Comenian 30 (1975) 71-93
29. Poljak S. and Tuza Z.: Maximum Cuts and Large Bipartite Subgraphs: In W. Cook, L. Lovasz and P. D. Seymour eels. DIMACS 20 (1995) 181-244
30. Trubin V.: On a method of solution of integer linear problems of a special kind. Soviet Mathematics Doklady 10 (1969) 1544-1546
31. Ziegler G. M.: Lectures on Polytopes. Graduate Texts in Mathematics 152 Springer-Verlag, New York, Berlin, Heidelberg (1995)