On the diameter of cut polytopes

DOI10.1016/j.disc.2016.01.002zbMath1338.52003OpenAlexW2262765272MaRDI QIDQ271649

José Neto

Publication date: 7 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.01.002

zbMATH Keywords

diametergraph partitioning(uniform) cut polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Generalized cut and metric polytopes of graphs and simplicial complexes

Cites Work

• Unnamed Item
• On the diameter of partition polytopes and vertex-disjoint cycle cover
• On the polyhedral structure of uniform cut polytopes
• From equipartition to uniform cut polytopes: extended polyhedral results
• Hamiltonicity and combinatorial polyhedra
• The Hirsch conjecture is true for (0,1)-polytopes
• Adjacency on combinatorial polyhedra
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
• Via Minimization with Pin Preassignments and Layer Preference
• Combinatorics and Geometry of Transportation Polytopes: An Update
• Lectures on Polytopes
• Convex Polytopes
• On the cut polytope
• Geometry of cuts and metrics

This page was built for publication: On the diameter of cut polytopes