New complexity results and algorithms for min-max-min robust combinatorial optimization.
Jannis KurtzPublished in: CoRR (2021)
Keyphrases
- combinatorial optimization
- max min
- combinatorial optimization problems
- optimization problems
- simulated annealing
- combinatorial problems
- metaheuristic
- traveling salesman problem
- hill climbing
- computational complexity
- worst case
- graph theory
- exact algorithms
- branch and bound algorithm
- hard combinatorial optimization problems
- learning algorithm
- mathematical programming
- branch and bound
- energy function
- linear programming
- robust optimization
- quadratic assignment problem
- cost function
- evolutionary algorithm