Min-max-min robust combinatorial optimization.
Christoph BuchheimJannis KurtzPublished in: Math. Program. (2017)
Keyphrases
- combinatorial optimization
- min max
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- max min
- branch and bound
- simulated annealing
- branch and bound algorithm
- multiobjective optimization
- combinatorial problems
- optimization problems
- mathematical programming
- quadratic assignment problem
- path relinking
- evolutionary algorithm
- max flow min cut
- graph theory
- exact algorithms
- single machine scheduling problem
- neural network
- vehicle routing problem
- search space
- hard combinatorial optimization problems
- search algorithm