Unbounded knapsack problems with arithmetic weight sequences
From MaRDI portal
Publication:545110
DOI10.1016/j.ejor.2011.03.028zbMath1215.90044MaRDI QIDQ545110
Gerhard J. Woeginger, Vladimir G. Deǐneko
Publication date: 22 June 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.03.028
computational complexity; dynamic programming; combinatorial optimization; polynomially solvable special case
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
90C39: Dynamic programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A new lower bound for the linear knapsack problem with general integer variables
- On variations of the subset sum problem
- A linear algorithm for integer programming in the plane
- On linear forms whose coefficients are in arithmetic progression
- Integer Programming with a Fixed Number of Variables
- When the Greedy Solution Solves a Class of Knapsack Problems
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- A polynomially solvable special case of the unbounded knapsack problem