Robust combinatorial optimization under budgeted-ellipsoidal uncertainty.
Jannis KurtzPublished in: EURO J. Comput. Optim. (2018)
Keyphrases
- combinatorial optimization
- metaheuristic
- simulated annealing
- traveling salesman problem
- combinatorial optimization problems
- robust optimization
- mathematical programming
- branch and bound algorithm
- optimization problems
- branch and bound
- combinatorial problems
- quadratic assignment problem
- hard combinatorial optimization problems
- estimation of distribution algorithms
- exact algorithms
- memetic algorithm
- single machine scheduling problem
- path relinking
- neural network
- max flow min cut
- graph theory
- search space
- knapsack problem
- combinatorial search
- optimal solution
- objective function