Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
From MaRDI portal
Publication:4393124
DOI10.1287/opre.45.5.768zbMath0902.90125MaRDI QIDQ4393124
Publication date: 10 August 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.5.768
Related Items
The multidimensional 0-1 knapsack problem -- bounds and computational aspects, A fast algorithm for strongly correlated knapsack problems, Some thoughts on combinatorial optimisation, The multidimensional 0-1 knapsack problem: an overview., New trends in exact algorithms for the \(0-1\) knapsack problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Where are the hard knapsack problems?, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, An exact algorithm for the knapsack sharing problem, Tree knapsack approaches for local access network design