On Two Class-Constrained Versions of the Multiple Knapsack Problem

Introduction to Algorithms

V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations

Computing, Computer Engineering, Computer Science +9

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

Bounds on Multiprocessing Timing Anomalies

Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations

Computing, Computer Science, Computer Systems +13

Bounds for Certain Multiprocessing Anomalies

Ronald Graham · Bell System Technical Journal · 1966 · 1.6K citations

Computing, Computer Engineering, Computer Science +14

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Óscar H. Ibarra, Chul E. Kim · Journal of the ACM · 1975 · 959 citations · Full text

Computing, Computer Science, Mathematics +11