Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation

Abstract

The Temporal Knapsack Problem (TKP) is a generalization of the standard Knapsack Problem where a time horizon is considered, and each item consumes the knapsack capacity during a limited time interval only. In this paper we solve the TKP using what we call a Recursive Dantzig-Wolfe Reformulation (DWR) method. The generic idea of Recursive DWR is to solve a… (More)
DOI: 10.1016/j.ipl.2016.01.008

Topics

5 Figures and Tables

Cite this paper

@article{Caprara2016SolvingTT, title={Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation}, author={Alberto Caprara and Fabio Furini and Enrico Malaguti and Emiliano Traversi}, journal={Inf. Process. Lett.}, year={2016}, volume={116}, pages={379-386} }