On scenario aggregation to approximate robust combinatorial optimization problems.
André B. ChasseinMarc GoerigkPublished in: Optim. Lett. (2018)
Keyphrases
- combinatorial optimization problems
- optimization problems
- combinatorial optimization
- knapsack problem
- discrete optimization
- metaheuristic
- ant colony optimization
- job shop scheduling
- real world
- traveling salesman problem
- shortest path problem
- continuous optimization problems
- special case
- learning algorithm
- min cost
- job shop scheduling problem
- directed graph
- state space
- search space
- lower bound