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: CoRR (2016)
Keyphrases
- min max
- combinatorial optimization problems
- linear programming
- combinatorial optimization
- optimization problems
- metaheuristic
- knapsack problem
- lower bound
- discrete optimization
- job shop scheduling
- shortest path problem
- linear program
- continuous optimization problems
- dynamic programming
- optimal solution
- reinforcement learning
- shortest path
- worst case
- min cost