Some computational results on real 0-1 knapsack problems

DOI10.1016/0167-6377(86)90105-7zbMath0596.90066OpenAlexW2029234384MaRDI QIDQ1079123

Richard A. Murphy

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90105-7

zbMATH Keywords

binary knapsack problemhybrid reduction schemeLagrangean-based reduction tests

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (4)

Comment on 'Some computational results on real 0-1 knapsack problems' ⋮ An improved enumeration for pure 0-1 programs ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ An improved direct descent algorithm for binary knapsack problems

Cites Work

• Unnamed Item
• An Algorithm for Large Zero-One Knapsack Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Reduction Algorithm for Zero-One Single Knapsack Problems
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• A Direct Descent Binary Knapsack Algorithm
• Modeling Facility Location Problems as Generalized Assignment Problems

This page was built for publication: Some computational results on real 0-1 knapsack problems