Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty.
Marc GoerigkJannis KurtzMichael PossPublished in: Discret. Appl. Math. (2020)
Keyphrases
- min max
- combinatorial problems
- constraint programming
- metaheuristic
- combinatorial optimization
- constraint satisfaction problems
- traveling salesman problem
- multiobjective optimization
- solving hard
- graph coloring
- constraint satisfaction
- max min
- phase transition
- combinatorial search
- global constraints
- branch and bound algorithm
- hard combinatorial optimization problems
- sat encodings
- constraint propagation
- simulated annealing
- graph colouring
- specific problems