Robust combinatorial optimization with knapsack uncertainty.
Michael PossPublished in: Discret. Optim. (2018)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- mathematical programming
- robust optimization
- optimization problems
- branch and bound algorithm
- combinatorial problems
- branch and bound
- quadratic assignment problem
- knapsack problem
- vehicle routing problem
- hard combinatorial optimization problems
- dynamic programming
- special case
- search space
- exact algorithms
- neural network
- uncertain data
- pairwise
- search algorithm