The simple graph partitioning problem is to partition an edge-weighted graph into mutually node-disjoint subgraphs, each containing at most b nodes, such that the sum of the weights of all edges in the subgraphs is maximal. In this paper we provide several classes of facet-defining inequalities for the associated simple graph partitioning polytope. © 2006 Elsevier Ltd. All rights reserved.
Sørensen, M. M. (2007). Facet-defining inequalities for the simple graph partitioning polytope. Discrete Optimization, 4(2), 221–231. https://doi.org/10.1016/j.disopt.2006.08.001