On the polyhedral structure of uniform cut polytopes

DOI10.1016/J.DAM.2014.05.032MaRDI QIDQ401136zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• From equipartition to uniform cut polytopes: extended polyhedral results
• On the cut polytope
• On the multiway cut polyhedron
• On polytopes cut by flats
• Uniform decompositions of polytopes
• Uniform Polyhedrals
• On the diameter of cut polytopes
• Cut locus realizations on convex polyhedra
• Delaunay polytopes of cut lattices
• scientific article; zbMATH DE number 957407

Cites work

• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Facets of the Bipartite Subgraph Polytope
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• From equipartition to uniform cut polytopes: extended polyhedral results
• Geometry of cuts and metrics
• Lectures on Polytopes
• Lifting facets of the cut polytope
• On the Graph Bisection Cut Polytope
• On the cut polyhedron.
• On the cut polytope
• Small min-cut polyhedra
• 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 inequicut cone
• The node capacitated graph partitioning problem: A computational study

Cited in

(14)

• Gorenstein cut polytopes
• Uniform Polyhedrals
• Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
• On the diameter of cut polytopes
• From equipartition to uniform cut polytopes: extended polyhedral results
• Applications of cut polyhedra. II
• On polytopes cut by flats
• On the matrix-cut rank of polyhedra.
• Retracts and algebraic properties of cut algebras
• Uniform decompositions of polytopes
• On the 3-Terminal Cut Polyhedron
• Cutting polytopes and flag \(f\)-vectors
• scientific article; zbMATH DE number 17641 (Why is no real title available?)
• Seminormality, canonical modules, and regularity of cut polytopes

Describes a project that uses

Uses Software

• PORTA

This page was built for publication: On the polyhedral structure of uniform cut polytopes

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