Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions.
Christoph BuchheimJannis KurtzPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- combinatorial optimization
- min max
- combinatorial problems
- combinatorial optimization problems
- simulated annealing
- traveling salesman problem
- metaheuristic
- optimization problems
- branch and bound
- multiobjective optimization
- exact algorithms
- mathematical programming
- branch and bound algorithm
- path relinking
- quadratic assignment problem
- estimation of distribution algorithms
- max min
- optimal solution
- combinatorial search
- benchmark problems
- solution space
- hard combinatorial optimization problems
- max flow min cut
- vehicle routing problem
- evolutionary algorithm
- pairwise