Joint Performance of Greedy Heuristics for the Integer Knapsack Problem

Abstract This paper analyzes the worst-case performance of combinations of greedy heuristics for the integer knapsack problem. If the knapsack is large enough to accomodate at least m units of any item, then the joint performance of the total-value and density-ordered greedy heuristics is no smaller than (m + 1) (m + 2) . For combinations of greedy heuristics that do not involve both the density-ordered and total-value greedy heuristics, the worst-case performance of the combination is no better than the worst-case performance of the single best heuristic in the combination.

[1]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[4]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[5]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  M. Fisher.  Worst-Case Analysis of Heuristic Algorithms , 1980 .

[7]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[8]  Michael A. Langston,et al.  Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..

[9]  Remo Guidieri.  Res , 1995, RES: Anthropology and Aesthetics.

[10]  Rajeev Kohli,et al.  A total-value greedy heuristic for the integer knapsack problem , 1992, Oper. Res. Lett..

[11]  Michael A. Langston,et al.  Analysis of a Compound bin Packing Algorithm , 1991, SIAM J. Discret. Math..