A complete anytime algorithm for number partitioning

Where the really hard problems are

Peter Cheeseman, Bob Kanefsky, William M. Taylor · 1991 · 1K citations

Computing, Computer Science, Mathematics +14

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

David S. Johnson, C. Aragon, Lyle A. McGeoch et al. · Operations Research · 1991 · 844 citations

Natural Sciences, Computer Science, Mathematics +16

Hard and easy distributions of SAT problems

David G. M. Mitchell, Bart Selman, Hector J. Levesque · National Conference on Artificial Intelligence · 1992 · 807 citations

Computing, Computer Science, Algorithms +8

Proceedings of the 5th International Conference on Genetic Algorithms

Stephanie Forrest · 1993 · 609 citations

Architecture, Computer Science, Algorithms +12

Computing Partitions with Applications to the Knapsack Problem

Ellis Horowitz, Sartaj Sahni · Journal of the ACM · 1974 · 565 citations · Full text

Natural Sciences, Computer Science, Mathematics +17