Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty.
Christoph BuchheimJannis KurtzPublished in: Discret. Optim. (2018)
Keyphrases
- combinatorial optimization
- max min
- robust optimization
- mathematical programming
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- min max
- traveling salesman problem
- optimization problems
- hill climbing
- combinatorial problems
- branch and bound algorithm
- branch and bound
- vehicle routing problem
- evolutionary algorithm
- tabu search
- hard combinatorial optimization problems
- max flow min cut
- submodular functions
- computational complexity
- belief functions
- ant colony optimization
- worst case
- case based reasoning
- quadratic assignment problem
- artificial neural networks
- difference equations
- optimal solution
- neural network