Roof duality, complementation and persistency in quadratic 0–1 optimization

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.1K citations · Full text

Engineering, Verification, Automated Proof +17

An analysis of approximations for maximizing submodular set functions—I

George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher · Mathematical Programming · 1978 · 4.4K citations

Engineering, Optimization Problem, Combinatorial Optimization +2

A linear-time algorithm for testing the truth of certain quantified boolean formulas

Bengt Aspvall, Michael F. Plass, Robert E. Tarjan · Information Processing Letters · 1979 · 893 citations

Mathematical Programming, Engineering, Boolean Function +11

Vertex packings: Structural properties and algorithms

G. L. Nemhauser, L. E. Trotter · Mathematical Programming · 1975 · 664 citations

Vertex Packings, Graph Theory, Structural Graph Theory +5

Integer Programming: Methods, Uses, Computations

Michel Balinski · Management Science · 1965 · 614 citations

Mathematical Programming, Cutting Plane Methods, Branch-and-bound Algorithm +20