Knapsack Problems with Setups

Sophie Michel 1, 2 Nancy Perrot 3 François Vanderbeck 2, 3
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Knapsack problems with setups find their application in many concrete industrial and financial problems. Moreover, they also arise as subproblems in a Dantzig-Wolfe decomposition approach to more complex combinatorial optimization problems, where they need to be solved repeatedly and therefore efficiently. Here, we consider the multiple-class integer knapsack problem with setups. Items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their class weight. The total weight of selected items and setups is bounded. The objective is to maximize the difference between the profits of selected items and the fixed costs incurred for setting-up classes. A special case is the bounded integer knapsack problem with setups where each class holds a single item and its continuous version where a fraction of an item can be selected while incurring a full setup. The paper shows the extent to which classical results for the knapsack problem can be generalized to these variants with setups. In particular, an extension of the branch-and-bound algorithm of Horowitz and Sahni is developed for problems with positive setup costs. Our direct approach is compared experimentally with the approach proposed in the literature consisting in converting the problem into a multiple choice knapsack with pseudo-polynomial size.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2009, 196, pp.909-918
Liste complète des métadonnées

https://hal.inria.fr/inria-00232782
Contributeur : François Vanderbeck <>
Soumis le : jeudi 27 novembre 2008 - 16:50:14
Dernière modification le : mercredi 18 avril 2018 - 11:06:05
Document(s) archivé(s) le : mercredi 22 septembre 2010 - 10:39:36

Fichier

fcknpWorkingPaperRevision2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00232782, version 2

Citation

Sophie Michel, Nancy Perrot, François Vanderbeck. Knapsack Problems with Setups. European Journal of Operational Research, Elsevier, 2009, 196, pp.909-918. 〈inria-00232782v2〉

Partager

Métriques

Consultations de la notice

521

Téléchargements de fichiers

215