A well-solvable special case of the bounded knapsack problem
From MaRDI portal
Publication:2275577
DOI10.1016/j.orl.2011.01.006zbMath1219.90137MaRDI QIDQ2275577
Vladimir G. Deǐneko, Gerhard J. Woeginger
Publication date: 9 August 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.01.006
computational complexity; combinatorial optimization; polynomial time algorithm; cross ratio ordered
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A polynomial-time algorithm for knapsack with divisible item sizes
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- The cutting stock problem and integer rounding
- A polynomially solvable special case of the unbounded knapsack problem