An extension of a greedy heuristic for the knapsack problem

DOI10.1016/0377-2217(91)90313-KzbMath0743.90082MaRDI QIDQ1178644

Douglas J. White

Publication date: 26 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

knapsack problemheuristicgreedy heuristic

Mathematics Subject Classification ID

Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Comparison and analysis of ten static heuristics-based Internet data replication techniques

Cites Work

• The knapsack problem: A survey
• When the Greedy Solution Solves a Class of Knapsack Problems
• Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of a greedy heuristic for the knapsack problem