Heuristic and exact algorithms for the interval min-max regret knapsack problem

Abstract

We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take any value in a range characterized by a minimum and a maximum possible profit. A set of specific profits is called a scenario. Each feasible solution associated with a scenario has a regret, given by the difference between the optimal solution value for such… (More)
View Slides

Topics

5 Figures and Tables

Statistics

05010015020162017
Citations per Year

Citation Velocity: 31

Averaging 31 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Furini2013HeuristicAE, title={Heuristic and exact algorithms for the interval min-max regret knapsack problem}, author={Fabio Furini and Manuel Iori and Silvano Martello and Mutsunori Yagiura}, year={2013} }