On the face lattice of the metric polytope

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 mn on n nodes and prove that for n ≥ 9 the faces of codimension 3 of mn are partitioned into 15 orbits of its symmetry group. For n ≤ 8, we describe additional upper layers of the face lattice of mn. In particular, using the list of orbits of high dimensional faces, we prove that the description of m8 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. © Springer-Verlag Berlin Heidelberg 2003.