A PTAS for the multiple subset sum problem with different knapsack capacities
From MaRDI portal
Publication:1607031
DOI10.1016/S0020-0190(00)00010-7zbMath1014.68225MaRDI QIDQ1607031
Alberto Caprara, Hans Kellerer, Ulrich Pferschy
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Multiple subset sum with inclusive assignment set restrictions, Approximation algorithms for scheduling with reservations, A branch-and-bound algorithm for hard multiple knapsack problems, LP based heuristics for the multiple knapsack problem with assignment restrictions, A successive approximation algorithm for the multiple knapsack problem, MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS, Lens Spaces, Isospectral on Forms but not on Functions, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Cites Work