Robust combinatorial optimization with variable budgeted uncertainty.
Michael PossPublished in: 4OR (2013)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- metaheuristic
- branch and bound algorithm
- mathematical programming
- branch and bound
- combinatorial problems
- graph theory
- vehicle routing problem
- quadratic assignment problem
- robust optimization
- optimization problems
- uncertain data
- evolutionary algorithm
- memetic algorithm
- search space