A (1–)-approximation algorithm for the generalized assignment problem

An approximation algorithm for the generalized assignment problem

David B. Shmoys, Éva Tardos · Mathematical Programming · 1993 · 722 citations

Computing, Computer Science, Mathematics +9

Maximum bounded 3-dimensional matching is MAX SNP-complete

Viggo Kann · Information Processing Letters · 1991 · 280 citations

Computing, Computer Science, Data Structures +6

A PTAS for the multiple knapsack problem

Chandra Chekuri, Sanjeev Khanna · ScholarlyCommons (University of Pennsylvania) · 2000 · 277 citations · Full text

Computing, Operations Management, Algorithms +14

Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

Milind Dawande, Jayant Kalagnanam, Pınar Keskinocak et al. · Journal of Combinatorial Optimization · 2000 · 144 citations

Computing, Computer Science, Algorithms +11

Geometric algorithms and combinatorial optimization

Gian‐Carlo Rota · Advances in Mathematics · 1990 · 13 citations

Natural Sciences, Mathematics, Algorithms +11