Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty.
Marc GoerigkAdam KasperskiPawel ZielinskiPublished in: J. Comb. Optim. (2022)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- optimization problems
- knapsack problem
- discrete optimization
- metaheuristic
- traveling salesman problem
- job shop scheduling
- robust optimization
- ant colony optimization
- lowest cost
- total cost
- continuous optimization problems
- shortest path problem
- information retrieval
- exact algorithms
- min cost
- cost function
- data structure