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