Robust Combinatorial Optimization with Locally Budgeted Uncertainty.
Marc GoerigkStefan LendlPublished in: Open J. Math. Optim. (2021)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- mathematical programming
- robust optimization
- branch and bound
- metaheuristic
- branch and bound algorithm
- combinatorial problems
- simulated annealing
- optimization problems
- multi class
- memetic algorithm
- combinatorial search
- exact algorithms
- quadratic assignment problem
- hard combinatorial optimization problems
- graph theory
- uncertain data
- tabu search
- special case
- support vector
- max flow min cut
- submodular functions
- evolutionary algorithm