A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem - Chekuri, Chandra; Khanna, Sanjeev (SIAM journal on computing, 2005)
Keywords: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Approximation; Assignment problem; Computer science; control theory; systems; Exact sciences and technology; Knapsack problem; Operations research; Profits; Restrictions; Theoretical computing; 68Q25; Bin packing problem; 68W25; Approximation algorithm; Knapsack problem; Polynomial time; Gap problem; multiple knapsack problem; Generalized assignment problem; Packing; approximation algorithm 68Q17; polynomial time approximation scheme; Best approximation