Solving sequential knapsack problems

DOI10.1016/0167-6377(93)90044-HzbMath0793.90039OpenAlexW1991782955MaRDI QIDQ688211

Todd Olmstead, Mark E. Hartmann

Publication date: 28 November 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90044-h

zbMATH Keywords

recursive algorithmrelaxation boundssequential knapsack problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Related Items (6)

On a particular case of the multi-criteria unconstrained optimization problem ⋮ A new upper bound for the multiple knapsack problem ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ Greedy algorithms for a class of knapsack problems with binary weights ⋮ A polynomial algorithm for the multiple knapsack problem with divisible item sizes ⋮ Easy weighted majority games

Cites Work

• A fast algorithm for optimal length-limited Huffman codes
• The cutting stock problem and integer rounding
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

This page was built for publication: Solving sequential knapsack problems