A General Algorithm for One-Dimensional Knapsack Problems
From MaRDI portal
Publication:4162968
DOI10.1287/opre.25.5.752zbMath0383.90079MaRDI QIDQ4162968
Giorgio P. Ingargiola, James F. Korsh
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.5.752
Related Items
A minimal algorithm for the Bounded Knapsack Problem, A randomized parallel branch-and-bound algorithm, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem, Algorithms for the bounded set-up knapsack problem