A total-value greedy heuristic for the integer knapsack problem

Authors:
Rajeev Kohli;Ramesh Krishnamurti
Affiliations:
Graduate School of Business, Columbia University, New York, NY 10027, USA;School of Computing Science, Simon Fraser University, Burnaby, BC V5A 1S6, Canada
Venue:
Operations Research Letters
Year:
1992

Citing 2
Cited 0

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Fast approximation algorithms for knapsack problems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines a new greedy heuristic for the integer knapsack problem. The proposed heuristic selects items in non-increasing order of their maximum possible contribution to the solution value given the available knapsack capacity at each step. The lower bound on the performance ratio for this ''total-value'' greedy heuristic is shown to dominate the corresponding lower bound for the density-ordered greedy heuristic.