The equipartition polytope. II: Valid inequalities and facets

DOI10.1007/BF01588779MaRDI QIDQ2639780zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1990

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01588779

zbMATH Keywords

cut polytopefacet inducing inequalitiesequicut polytopeequipartition polytope

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Boolean programming (90C09)

Cites work

• Facets of the Bipartite Subgraph Polytope
• On the cut polytope
• The equipartition polytope. I: Formulations, dimension and basic facets

Cited in

(23)

• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Equipartition sets of hypercubes. II
• Facet-defining inequalities for the simple graph partitioning polytope
• On the polyhedral structure of uniform cut polytopes
• From equipartition to uniform cut polytopes: extended polyhedral results
• Facets of the \(k\)-partition polytope
• The partition problem
• Some new classes of facets for the equicut polytope
• Valid inequalities and cutting planes for some polytopes
• The inequicut cone
• A branch-and-cut algorithm for the equicut problem
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Min-cut clustering
• Political districting to minimize cut edges
• Solution of large weighted equicut problems
• Formulations and valid inequalities of the node capacitated graph partitioning problem
• Application of cut polyhedra. I
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• Cardinality constrained Boolean quadratic polytope
• Size-constrained graph partitioning polytopes
• Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
• Engineering branch-and-cut algorithms for the equicut problem
• A polyhedral approach for a constrained quadratic 0-1 problem

This page was built for publication: The equipartition polytope. II: Valid inequalities and facets

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