Abstract
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration algorithms designed for general polytopes, algorithms using their large symmetry groups can exhibit strong performances. Specifically we consider the metric polytope m n on n nodes and prove that for n≥ 9 the faces of codimension 3 of m n are partitioned into 15 orbits of its symmetry group. For n≤ 8, we describe additional upper layers of the face lattice of m n . In particular, using the list of orbits of high dimensional faces, we prove that the description of m 8 given in [9] is complete with 1 550 825 000 vertices and that the Laurent-Poljak conjecture [16] holds for n≤ 8. Computational issues for the orbitwise face and vertex enumeration algorithms are also discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Avis, D.: lrs homepage, School of Computer Science, McGill University, Canada (2001), http://www.cgm.cs.mcgill.ca/~avis/C/lrs.html
Avis, D., Bremner, D., Seidel, R.: How good are convex hull algorithms? Computational Geometry: Theory and Applications 7, 265–301 (1997)
Avis, D., Fukuda, K., Picozzi, S.: On canonical representations of convex polyhedra. In: Cohen, A.M., Gao, X.S., Tokuyama, N. (eds.) Mathematical Software, pp. 351–360. World Scientific, Singapore (2002)
Christof, T., Reinelt, G.: Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes. International Journal of Computational Geometry and Applications 11(4), 423–437 (2001)
Deza, A.: Metric polytope homepage, Math. and Comput. Sci. Dept., Tokyo Institute of Technology, Japan (2002), http://www.is.titech.ac.jp/~deza/metric.html
Deza, A., Deza, M.: The ridge graph of the metric polytope and some relatives. In: Bisztriczky, T., McMullen, P., Schneider, R., Weiss, A.I. (eds.) Polytopes: Abstract, Convex and Computational, pp. 359–372 (1994)
Deza, A., Deza, M.: The combinatorial structure of small cut and metric polytopes. In: Ku, T.H. (ed.) Combinatorics and Graph Theory, pp. 70–88. World Scientific, Singapore (1995)
Deza, A., Deza, M., Fukuda, K.: On skeletons, diameters and volumes of metric polyhedra. In: Deza, M., Euler, R., Manoussakis, Y. (eds.) CCS 1995. LNCS, vol. 1120, pp. 112–128. Springer, Heidelberg (1996)
Deza, A., Fukuda, K., Pasechnik, D.V., Sato, M.: On the skeleton of the metric polytope. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol. 2098, pp. 125–136. Springer, Heidelberg (2001)
Deza, B., Goldengorin, D.: Pasechnik: e-print math.MG/0306049 at arXiv.org (2003), http://arXiv.org/abs/math.MG/0306049
Deza, M., Grishukhin, V., Laurent, M.: The symmetries of the cut polytope and of some relatives. In: Gritzmann, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics, the ”Victor Klee Festschrift”. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 205–220 (1991)
Deza, M., Laurent, M.: Geometry of cuts and metrics. Algorithms and Combinatorics, vol. 15. Springer, Heidelberg (1997)
Fukuda, K.: cddlib reference manual, cddlib Version 0.92, ETHZ, Zürich, Switzerland (2001), http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html
Fukuda, K., Rosta, V.: Combinatorial face enumeration in convex polytopes. Computational Geometry: Theory and Applications 4, 191–198 (1994)
Laurent, M.: Graphic vertices of the metric polytope. Discrete Mathematics 151, 131–153 (1996)
Laurent, M., Poljak, S.: The metric polytope. In: Balas, E., Cornuejols, G., Kannan, R. (eds.) Integer Programming and Combinatorial Optimization, pp. 247–286 (1992)
Poljak, S., Tuza, Z.: Maximum cuts and large bipartite subgraphs. In: Cook, W., Lovasz, L., Seymour, P. (eds.). DIMACS Series 20, pp. 181–244 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deza, A., Fukuda, K., Mizutani, T., Vo, C. (2003). On the Face Lattice of the Metric Polytope. In: Akiyama, J., Kano, M. (eds) Discrete and Computational Geometry. JCDCG 2002. Lecture Notes in Computer Science, vol 2866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44400-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-44400-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20776-4
Online ISBN: 978-3-540-44400-8
eBook Packages: Springer Book Archive