Formulations and valid inequalities for the node capacitated graph partitioning problem

Non-separable and planar graphs

Hassler Whitney · Transactions of the American Mathematical Society · 1932 · 506 citations · Full text

Natural Sciences, Mathematics, Circuit Theory +9

On the cut polytope

Francisco Barahona, Ali Ridha Mahjoub · Mathematical Programming · 1986 · 379 citations

Natural Sciences, Computer Science, Mathematics +8

A cutting plane algorithm for a clustering problem

Martin Grötschel, Yoshiko Wakabayashi · Mathematical Programming · 1989 · 314 citations · Full text

Computing, Computer Science, Algorithms +6

The partition problem

Sunil Chopra, M. R. Rao · Mathematical Programming · 1993 · 254 citations

Min-cut clustering

Ellis L. Johnson, Anuj Mehrotra, George L. Nemhauser · Mathematical Programming · 1993 · 224 citations