On the polyhedral structure of uniform cut polytopes

DOI10.1016/j.dam.2014.05.032zbMath1298.05267OpenAlexW1978256290MaRDI QIDQ401136

José Neto

Publication date: 26 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.032

zbMATH Keywords

graph partitioninguniform cut polytopes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On the diameter of cut polytopes ⋮ Retracts and algebraic properties of cut algebras ⋮ Seminormality, canonical modules, and regularity of cut polytopes

Uses Software

• PORTA

Cites Work

• Unnamed Item
• Unnamed Item
• From equipartition to uniform cut polytopes: extended polyhedral results
• The inequicut cone
• Lifting facets of the cut polytope
• The node capacitated graph partitioning problem: A computational study
• On the cut polyhedron.
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• 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
• Small Min-Cut Polyhedra
• On the Graph Bisection Cut Polytope
• Facets of the Bipartite Subgraph Polytope
• Lectures on Polytopes
• On the cut polytope
• Geometry of cuts and metrics