Knapsack problems with setups

  title={Knapsack problems with setups},
  author={S. Michel and Nancy Perrot and François Vanderbeck},
  journal={European Journal of Operational Research},
RÉSUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a DantzigWolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary 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… CONTINUE READING