Improving logic-based Benders' algorithms for solving min-max regret problems.
Lucas AssunçãoAndréa Cynthia SantosThiago F. NoronhaRafael AndradePublished in: Oper. Res. Decis. (2021)
Keyphrases
- min max
- combinatorial optimization
- convex optimization problems
- solving problems
- optimization problems
- learning algorithm
- efficient algorithms for solving
- problems in artificial intelligence
- convex optimization
- quadratic optimization problems
- online convex optimization
- combinatorial optimization problems
- np complete
- worst case
- lower bound
- np complete problems
- search heuristics
- constraint problems
- computational complexity
- constrained problems
- decomposition algorithm
- combinatorial problems
- test problems
- exact algorithms
- partial solutions
- bandit problems
- decision problems
- upper bound