A polynomial-time algorithm for knapsack with divisible item sizes
From MaRDI portal
Publication:287072
DOI10.1016/S0020-0190(97)00061-6zbMath1337.68140MaRDI QIDQ287072
Wim F. J. Verhaegh, Emile H. L. Aarts
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00061-6
Related Items
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties, A polynomial algorithm for the multiple knapsack problem with divisible item sizes, The complexity of multidimensional periodic scheduling, A well-solvable special case of the bounded knapsack problem, A new upper bound for the multiple knapsack problem
Cites Work