\(b\)-tree facets for the simple graph partitioning polytope
From MaRDI portal
Publication:1768607
DOI10.1023/B:JOCO.0000031417.96218.26zbMath1136.90525OpenAlexW2053854252MaRDI QIDQ1768607
Publication date: 15 March 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000031417.96218.26
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
An overview of graph covering and partitioning ⋮ Size-constrained graph partitioning polytopes ⋮ The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Facet-defining inequalities for the simple graph partitioning polytope ⋮ Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes
This page was built for publication: \(b\)-tree facets for the simple graph partitioning polytope
