Robust two-stage combinatorial optimization problems under convex uncertainty.
Marc GoerigkAdam KasperskiPawel ZielinskiPublished in: CoRR (2019)
Keyphrases
- combinatorial optimization problems
- optimization problems
- knapsack problem
- combinatorial optimization
- metaheuristic
- ant colony optimization
- discrete optimization
- job shop scheduling
- shortest path problem
- convex optimization
- robust optimization
- traveling salesman problem
- continuous optimization problems
- job shop scheduling problem
- convex hull
- query expansion
- objective function
- machine learning