Lower bounds to the graph partitioning problem through generalized linear programming and network flowsM. Minoux and E. PinsonRAIRO-Oper. Res., 21 4 (1987) 349-364DOI: https://doi.org/10.1051/ro/1987210403491
