Mathematical Programming · 1974 · 88 citations · 15 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationBranch And BoundComplexity TheoryComputational ComplexityInteger ProgrammingEnumerative AlgorithmsInteger Programming ModelsInteger Programming Relaxations
15
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
An Automatic Method of Solving Discrete Programming Problems
A. H. Land, A. G. Doig · Econometrica · 1960 · 1.9K citations
An Algorithm for the Traveling Salesman Problem
John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research · 1963 · 1K citations · Full text
HOW GOOD IS THE SIMPLEX ALGORITHM
Victor Klee, George J. Minty · 1970 · 784 citations