An improved direct descent algorithm for binary knapsack problems

DOI10.1016/0305-0548(89)90002-6zbMath0664.90058OpenAlexW2002650160MaRDI QIDQ1115799

Richard A. Murphy

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90002-6

zbMATH Keywords

computational testingbinary knapsackdirect descent algorithmgeneral fathom and backtrack methodologyreduction tests

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (1)

A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem

Cites Work

• Some computational results on real 0-1 knapsack problems
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• 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
• Computing Partitions with Applications to the Knapsack 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: An improved direct descent algorithm for binary knapsack problems