Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem

Abstract

We study a natural generalization of the knapsack problem, in which each item exists only for a given time interval. One has to select a subset of the items (as in the classical case), guaranteeing that for each time instant the set of existing selected items has total weight not larger than the knapsack capacity. We focus on the exact solution of the… (More)
DOI: 10.1287/ijoc.1120.0521

Topics

9 Figures and Tables

Cite this paper

@article{Caprara2013UncommonDR, title={Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem}, author={Alberto Caprara and Fabio Furini and Enrico Malaguti}, journal={INFORMS Journal on Computing}, year={2013}, volume={25}, pages={560-571} }