On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs.
Lucas AssunçãoAndréa Cynthia SantosThiago F. NoronhaRafael AndradePublished in: ISCO (2016)
Keyphrases
- min max
- optimization problems
- nonlinear programming
- benders decomposition
- worst case
- combinatorial optimization
- nonlinear optimization problems
- evolutionary algorithm
- mixed integer
- lower bound
- network design problem
- combinatorial optimization problems
- metaheuristic
- dynamic programming
- objective function
- linear programming
- convergence rate
- exact algorithms