A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.
Lucas AssunçãoThiago F. NoronhaAndréa Cynthia SantosRafael AndradePublished in: Comput. Oper. Res. (2017)
Keyphrases
- min max
- combinatorial optimization problems
- linear programming
- combinatorial optimization
- dynamic programming
- discrete optimization
- knapsack problem
- optimal solution
- shortest path problem
- simulated annealing
- optimization problems
- metaheuristic
- interval data
- neural network
- max min
- exact algorithms
- total cost
- linear program
- ant colony optimization
- online learning
- cost function
- search algorithm