Sensitivity analysis of the knapsack sharing problem: perturbation of the weight

Tarik Belgacem () and Mhand Hifi ()
Additional contact information
Tarik Belgacem: CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique
Mhand Hifi: CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, UPJV - Université de Picardie Jules Verne

Post-Print from HAL

Abstract: In this paper, we study the sensitivity analysis of the optimum of the knapsack sharing problem (KSP) to the perturbation of the weight of an arbitrary item. We determine the interval limits of the weight of each perturbed item using a heuristic approach which reduces the original problem to a series of single knapsackk problems. A perturbed item belongs either to an optimal class, or to a non-optimal class. We evaluate the performance of the proposed heuristic on a set problem instances of the literature. Encouraging results are obtained.

Keywords: Stability; knapsack sharing problem; combinatorial optimization; knapsack problem; Stabilité; partage équitable; max-min; optimisation combinatoire; sac à dos (search for similar items in EconPapers)
Date: 2007-11
References: Add references at CitEc
Citations:

Published in 2007

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-00188333

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().