Cut and flow formulations for the balanced connected \(k\)-partition problem

DOI10.1007/978-3-030-53262-8_11zbMath1458.90556OpenAlexW3045113019MaRDI QIDQ2225055

Phablo F. S. Moura, Yoshiko Wakabayashi, Matheus J. Ota, Flávio K. Miyazawa

Publication date: 4 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-53262-8_11

zbMATH Keywords

polyhedrainteger linear programmingbranch-and-cutfacetconnected partition

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (3)

An overview of graph covering and partitioning ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds ⋮ Partitioning a graph into balanced connected classes: formulations, separation and experiments

This page was built for publication: Cut and flow formulations for the balanced connected \(k\)-partition problem