The Multiple Subset Sum Problem
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 11 (2), 308-319
- https://doi.org/10.1137/s1052623498348481
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A PTAS for the Multiple Subset Sum Problem with different knapsack capacitiesInformation Processing Letters, 2000
- The exact LPT-bound for maximizing the minimum completion timeOperations Research Letters, 1992
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981