A note on some computationally difficult set covering problems

A Greedy Heuristic for the Set-Covering Problem

Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations

Natural Sciences, Computer Science, Mathematics +17

An Improved Implicit Enumeration Approach for Integer Programming

Arthur M. Geoffrion · Operations Research · 1969 · 231 citations

Natural Sciences, Computer Science, Mathematics +13

Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

C. E. Lemke, Harvey M. Salkin, Kurt Spielberg · Operations Research · 1971 · 131 citations

Natural Sciences, Computer Science, Mathematics +14

Hard Knapsack Problems

Vašek Chvátal · Operations Research · 1980 · 128 citations

Computing, Computer Science, Mathematics +13

On the lengths of proofs in the propositional calculus (Preliminary Version)

Stephen Cook, Robert A. Reckhow · 1974 · 99 citations · Full text

Computing, Computer Science, Mathematics +12