Knapsack problems with setups

Sophie Michel

doi:10.1016/j.ejor.2008.05.001

2009-08-01

Sophie Michel

Nancy Perrot

François Vanderbeck *

DOI：10.1016/j.ejor.2008.05.001

原文链接

查看原文

摘要

En 中文

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. (C) 2008 Elsevier B.V. All rights reserved.

Keyword:

Knapsack problem

Fixed cost

Setup

Variable upper bound

Branch-and-bound