From equipartition to uniform cut polytopes: extended polyhedral results

DOI10.1016/J.DISC.2011.01.018MaRDI QIDQ533779zbMATH OpenOpenAlexFDO

Authors José Neto

Publication date 6 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph partitioninguniform cut polytopes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the polyhedral structure of uniform cut polytopes
• On the diameter of cut polytopes
• Some new classes of facets for the equicut polytope
• On the directed cut cone and polytope
• On the cut polyhedron.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A branch-and-cut algorithm for the equicut problem
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
• Facets of the Bipartite Subgraph Polytope
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Geometry of cuts and metrics
• On the Graph Bisection Cut Polytope
• On the cut polytope
• Some new classes of facets for the equicut polytope
• The equipartition polytope. I: Formulations, dimension and basic facets
• The equipartition polytope. II: Valid inequalities and facets
• The node capacitated graph partitioning problem: A computational study
• Via Minimization with Pin Preassignments and Layer Preference

Cited in

(3)

• On the polyhedral structure of uniform cut polytopes
• On the diameter of cut polytopes
• The equipartition polytope. I: Formulations, dimension and basic facets

This page was built for publication: From equipartition to uniform cut polytopes: extended polyhedral results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533779)