A complementary greedy heuristic for the knapsack problem

A complementary greedy heuristic for the knapsack problem

0.00 Avg rating—0 Votes
Article ID: iaor19961031
Country: Netherlands
Volume: 62
Issue: 1
Start Page Number: 85
End Page Number: 95
Publication Date: Oct 1992
Journal: European Journal of Operational Research
Authors:
Keywords: knapsack problem
Abstract:

This paper considers the structural properties of an alternative O(n’2) time complexity heuristic to the usual standard greedy heuristic. It is shown that the worst case bound result is better, and that the alternative heuristic may be useable in a complementary model to it, performing well where the standard heuristic performs poorly.

Reviews

Required fields are marked *. Your email address will not be published.