A complementary greedy heuristic for the knapsack problem

DOI10.1016/0377-2217(92)90179-DzbMath0761.90074OpenAlexW1963578197MaRDI QIDQ1203804

Douglas J. White

Publication date: 18 February 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90179-d

zbMATH Keywords

knapsack problemgreedy heuristic

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The knapsack problem: A survey
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: A complementary greedy heuristic for the knapsack problem