Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem.
Fabio FuriniManuel IoriSilvano MartelloMutsunori YagiuraPublished in: INFORMS J. Comput. (2015)
Keyphrases
- exact algorithms
- min max
- knapsack problem
- benchmark instances
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- vehicle routing problem with time windows
- greedy heuristic
- lower bound
- np hard
- benders decomposition
- greedy algorithm
- linear programming relaxation
- heuristic solution
- multidimensional knapsack problem
- randomly generated test instances
- exact solution
- maximum profit
- neural network
- evolutionary algorithm
- cutting plane
- combinatorial problems
- special case
- vehicle routing problem
- cost function
- combinatorial optimization
- worst case