Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item

Computers and Operations Research

Volumn 35, Issue 1, 2008, Pages 295-308

  Belgacem, T ^b   Hifi, M ^a,b  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

Combinatorial optimization; Knapsack problem; Knapsack sharing; Sensitivity analysis

Indexed keywords

HEURISTIC METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SENSITIVITY ANALYSIS; SET THEORY;

INTERVAL LIMITS; KNAPSACK PROBLEMS; KNAPSACK SHARING; NON-OPTIMAL CLASS;

COMBINATORIAL OPTIMIZATION;

EID: 34250155624     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.02.025     Document Type: Article

References (21)

1. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems (2004), Springer, Berlin [ISBN: 3-540-40286-1]
2. Yamada T., and Futakawa M. Heuristic and reduction algorithms for the knapsack sharing problem. Computers and Operations Research 24 (1997) 961-967
3. Brown J.R. Solving knapsack sharing with general tradeoff functions. Mathematical Programming 51 (1991) 55-73
4. Kuno T., Konno H., and Zemel E. A linear-time algorithm for solving continuous maximum knapsack problems. Operations Research Letters 10 (1991) 23-26
5. Luss H. Minmax resource allocation problems: optimization and parametric analysis. European Journal of Operational Research 60 (1992) 76-86
6. Pang J.S., and Yu C.S. A min-max resource allocation problem with substitutions. European Journal of Operational Research 41 (1989) 218-223
7. Tang C.S. A max-min allocation problem: its solutions and applications. Operations Research 36 (1988) 359-367
8. Yamada T., Futakawa M., and Kataoka S. Some exact algorithms for the knapsack sharing problem. European Journal of Operational Research 106 (1998) 177-183
9. Hifi M., and Sadfi S. The knapsack sharing problem: an exact algorithm. Journal of Combinatorial Optimization 6 (2002) 35-54
10. Hifi M., Mhalla H., and Sadfi S. An exact algorithm for the knapsack sharing problem. Computers and Operations Research 32 (2005) 1311-1324
11. Hifi M, Mhalla H. Guessing a branch and bound method for the knapsack sharing problem. Working Paper, CERMSEM, MSE, Université Paris 1; 2005.
12. Hifi M, Mhalla H. Une méthode exacte pour le problème du partage équitable. Cinquième Congrès de la Recherche Opérationnelle et d'Aide à la Décision-ROADEF, Rouen, France; 2005.
13. Nauss R. Parametric integer programming (1979), University of Missouri Press, Columbia, MI
14. Ghosh D, Charkravarti D, Sierksma G. Sensitivity analysis of a greedy heuristic for knapsack problems. European Journal of Operational Research, 2005;169:340-50.
15. Blair C. Sensitivity analysis of knapsack problems: a negative result. Discrete Applied Mathematics 82 (1998) 133-139
16. Woeginger G.J. Sensitivity analysis for knapsack problems: another negative result. Discrete Applied Mathematics 92 (1999) 247-251
17. Hifi M, Mhalla H, Sadfi S. Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary knapsack problem. Journal of Combinatorial Optimization, 2005;10:239-60.
18. Belgacem T, Hifi M. Sensitivity analysis of the knapsack sharing problem. Working Paper, CERMSEM, MSE, Université Paris 1 Panthéon-Sorbonne, 2005.
19. Hifi M, Mhalla H, Sadfi S. Adaptive algorithms for the knapsack problem: perturbation of an arbitrary item. Working Paper, CERMSEM-CNRS UMR 8095, MSE, Université Paris 1; 2004.
20. Greenberg H.J. An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization. In: Woodruff D.L. (Ed). Advances in computational and stochastic optimization, logic programming, and heuristic search (1998), Kluwer Academic Publishers, Dordrecht 97-148
21. Dantzig G.B. Discrete variable extremum problems. Operations Research 5 (1957) 266-277