On the cut polytope

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA · 1981 · 2K citations

Mathematical Programming, Large-scale Global Optimization, Engineering +6

On the computational complexity of Ising spin glass models

Francisco Barahona · Journal of Physics A Mathematical and General · 1982 · 1.3K citations · Full text

On the notion of balance of a signed graph.

Frank Harary · The Michigan Mathematical Journal · 1953 · 1K citations · Full text

Signed Graph, Network Science, Graph Theory +1

Finding a Maximum Cut of a Planar Graph in Polynomial Time

Frank Hadlock · SIAM Journal on Computing · 1975 · 394 citations

Mathematical Programming, Engineering, Maximum Cut Problem +20

The max-cut problem on graphs not contractible to K5

Francisco Barahona · Operations Research Letters · 1983 · 142 citations

Mathematical Programming, Engineering, Graph Theory +8