A new lower bound for the linear knapsack problem with general integer variables
From MaRDI portal
Publication:859686
DOI10.1016/j.ejor.2006.02.018zbMath1163.90716OpenAlexW2013441581MaRDI QIDQ859686
Kamlesh Mathur, Prahalad Venkateshan
Publication date: 16 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.018
Related Items (4)
Determining the \(K\)-best solutions of knapsack problems ⋮ Tight bounds for periodicity theorems on the unbounded knapsack problem ⋮ A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production ⋮ Unbounded knapsack problems with arithmetic weight sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new enumeration scheme for the knapsack problem
- On dominated terms in the general knapsack problem
- When the Greedy Solution Solves a Class of Knapsack Problems
- Canonical Coin Changing and Greedy Solutions
- Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
- A polynomially solvable special case of the unbounded knapsack problem
This page was built for publication: A new lower bound for the linear knapsack problem with general integer variables