Abstract The metric polytope metn is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities xij − xik − xjk ≤ 0 and xij + xik + x...
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...