The equipartition polytope. II: Valid inequalities and facets
From MaRDI portal
Publication:2639780
DOI10.1007/BF01588779zbMath0718.90093OpenAlexW2069107464MaRDI QIDQ2639780
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
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
The partition problem, Application of cut polyhedra. I, Facets of the \(k\)-partition polytope, Some new classes of facets for the equicut polytope, A polyhedral approach for a constrained quadratic 0-1 problem, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, Cardinality constrained Boolean quadratic polytope, A branch-and-cut algorithm for the equicut problem, The Boolean quadratic polytope: Some characteristics, facets and relatives, Size-constrained graph partitioning polytopes, On the polyhedral structure of uniform cut polytopes, Facet-defining inequalities for the simple graph partitioning polytope, Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes, The inequicut cone, From equipartition to uniform cut polytopes: extended polyhedral results, A branch-and-cut algorithm for the partitioning-hub location-routing problem, Formulations and valid inequalities of the node capacitated graph partitioning problem, Engineering Branch-and-Cut Algorithms for the Equicut Problem, Political districting to minimize cut edges, Min-cut clustering, Solution of large weighted equicut problems
Cites Work
