DocumentCode
1672000
Title
Sensitivity analysis of the knapsack problem: an improved result
Author
Belgacem, Tarik ; Hifi, Mhand
Author_Institution
CERMSEM, Univ. of Paris 1
Volume
2
fYear
2006
Firstpage
934
Lastpage
939
Abstract
In this paper, we study the sensitivity of the optimum of the knapsack problem (KP), to the perturbation of the profit of a subset of items. We mainly establish the upper and lower limits of the sensitivity interval, by improving our previous result
Keywords
knapsack problems; optimisation; set theory; knapsack problem; optimisation; sensitivity analysis; subset theory; Adaptive algorithm; Data analysis; Dynamic programming; Large-scale systems; Linear programming; Sensitivity analysis; Stability analysis; Upper bound; Combinatorial optimization; knapsack; optimization; sensitivity analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Systems and Service Management, 2006 International Conference on
Conference_Location
Troyes
Print_ISBN
1-4244-0450-9
Electronic_ISBN
1-4244-0451-7
Type
conf
DOI
10.1109/ICSSSM.2006.320757
Filename
4114616
Link To Document