Unbounded knapsack problems with arithmetic weight sequences
DOI10.1016/J.EJOR.2011.03.028zbMATH Open1215.90044OpenAlexW2090987741MaRDI QIDQ545110FDOQ545110
Authors: Gerhard J. Woeginger, Vladimir G. Deineko 
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
Recommendations
computational complexitycombinatorial optimizationdynamic programmingpolynomially solvable special case
Combinatorial optimization (90C27) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 new lower bound for the linear knapsack problem with general integer variables
- A linear algorithm for integer programming in the plane
- On variations of the subset sum problem
- On linear forms whose coefficients are in arithmetic progression
- A polynomially solvable special case of the unbounded knapsack problem
Cited In (6)
- The unbounded knapsack problem
- A polynomially solvable special case of the unbounded knapsack problem
- A polynomial-time algorithm for knapsack with divisible item sizes
- A constructive periodicity bound for the unbounded knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Tight bounds for periodicity theorems on the unbounded knapsack problem
This page was built for publication: Unbounded knapsack problems with arithmetic weight sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545110)
