A well-solvable special case of the bounded knapsack problem

DOI10.1016/j.orl.2011.01.006zbMath1219.90137OpenAlexW2131397354MaRDI 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

zbMATH Keywords

computational complexitycombinatorial optimizationpolynomial time algorithmcross ratio ordered

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Using well-solvable minimum cost exact covering for VLSI clock energy minimization

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

This page was built for publication: A well-solvable special case of the bounded knapsack problem