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

Authors:
T. Belgacem;M. Hifi
Affiliations:
CERMSEM, Université de Paris 1, 106-112 boulevard de l'Hôpital, 75647 Paris cedex 13, France;LaRIA, Université de Picardie Jules Verne, 5 rue du Moulin Neuf, 80000 Amiens, France and CERMSEM, Université de Paris 1, 106-112 boulevard de l'Hôpital, 75647 Paris cedex 13, Franc ...
Venue:
Computers and Operations Research
Year:
2008

Citing 8
Cited 2

A max-min allocation problem: its solutions and applications

Operations Research
Solving knapsack sharing problems with general tradeoff functions

Mathematical Programming: Series A and B
Heuristic and reduction algorithms for the knapsack sharing problem

Computers and Operations Research
Sensitivity analysis for knapsack problems: a negative result

Discrete Applied Mathematics
An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization

Advances in computational and stochastic optimization, logic programming, and heuristic search
Sensitivity analysis for knapsack problems: another negative result

Discrete Applied Mathematics
An exact algorithm for the knapsack sharing problem

Computers and Operations Research
A linear-time algorithm for solving continuous maximin knapsack problems

Operations Research Letters

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem

Computers and Operations Research
Stability measure for a generalized assembly line balancing problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

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 knapsack 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 of problem instances of the literature. Encouraging results are obtained.