A General Algorithm for One-Dimensional Knapsack Problems
From MaRDI portal
Publication:4162968
DOI10.1287/opre.25.5.752zbMath0383.90079OpenAlexW2015882271MaRDI 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 (4)
A randomized parallel branch-and-bound algorithm ⋮ A minimal algorithm for the Bounded Knapsack Problem ⋮ Algorithms for the bounded set-up knapsack problem ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
This page was built for publication: A General Algorithm for One-Dimensional Knapsack Problems
