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: CoRR (2020)
Keyphrases
- min max
- optimization problems
- nonlinear programming
- benders decomposition
- worst case
- evolutionary algorithm
- combinatorial optimization
- optimal solution
- dynamic programming
- linear programming
- convergence rate
- metaheuristic
- mixed integer
- upper bound
- cost function
- network design problem
- lower bound
- nonlinear optimization problems
- traveling salesman problem
- objective function
- finite number
- combinatorial optimization problems
- shortest path