Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty.
André B. ChasseinMarc GoerigkJannis KurtzMichael PossPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- combinatorial problems
- max min
- combinatorial optimization
- constraint programming
- constraint satisfaction problems
- computational complexity
- learning algorithm
- orders of magnitude
- specific problems
- graph colouring
- optimization problems
- metaheuristic
- constraint satisfaction
- worst case
- dynamic programming
- traveling salesman problem
- phase transition
- hill climbing
- online algorithms
- particle swarm optimization
- space complexity
- search space