Sensitivity analysis of the greedy heuristic for binary knapsack problems
AbstractGreedy heuristics are a popular choice of heuristics when we have to solve a large variety of NP -hard combinatorial problems. In particular for binary knapsack problems, these heuristics generate good results. If some uncertainty exists beforehand regarding the value of any one element in the problem data, sensitivity analysis procedures can be used to know the tolerance limits within which the value may vary will not cause changes in the output. In this paper we provide a polynomial time characterization of such limits for greedy heuristics on two classes of binary knapsack problems, namely the 0-1 knapsack problem and the subset sum problem. We also study the relation between algorithms to solve knapsack problems and algorithms to solve their sensitivity analysis problems, the conditions under which the sensitivity analysis of the heuristic generates bounds for the toler-ance limits for the optimal solutions, and the empirical behavior of the greedy output when there is a change in the problem data.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Groningen, Research Institute SOM (Systems, Organisations and Management) in its series Research Report with number 00A18.
Date of creation: 2000
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2000-07-27 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Chakravarty, Nilotpal & Goel, Anand Mohan & Sastry, Trilochan, 2000. "Easy weighted majority games," Mathematical Social Sciences, Elsevier, vol. 40(2), pages 227-235, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joke Bulthuis).
If references are entirely missing, you can add them using this form.