A complementary greedy heuristic for the knapsack problem

DOI10.1016/0377-2217(92)90179-DMaRDI QIDQ1203804zbMATH OpenOpenAlexFDO

Authors D. 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

greedy heuristicknapsack problem

Mathematics Subject Classification ID

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

Review text

Some structural properties but no computational results of a new \(O(n^ 2)\)-heuristic for the usual knapsack problem are given. There are some connections to the well-known greedy heuristic but these cannot be discussed here.

Recommendations

• An extension of a greedy heuristic for the knapsack problem
• A total-value greedy heuristic for the integer knapsack problem
• The problem of the compartmentalized knapsack: a proposal of three new heuristics
• scientific article; zbMATH DE number 4189472
• Heuristics for the 0-1 multidimensional knapsack problem
• On the optimality of the greedy solutions of the general knapsack problems
• Joint performance of greedy heuristics for the integer knapsack problem
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems

Cites work

• A Linear Programming Approach to the Cutting Stock Problem—Part II
• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4189487 (Why is no real title available?)
• The knapsack problem: A survey

Cited in

(1)

• An extension of a greedy heuristic for the knapsack problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1203804)