Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty.
Marc GoerigkAdam KasperskiPawel ZielinskiPublished in: OR (2019)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- discrete optimization
- continuous optimization problems
- optimization problems
- knapsack problem
- metaheuristic
- traveling salesman problem
- robust optimization
- ant colony optimization
- job shop scheduling
- shortest path problem
- job shop scheduling problem
- min cost
- convex optimization problems
- convex optimization
- exact algorithms
- neural network
- branch and bound algorithm
- quadratic assignment problem
- convex programming
- branch and bound
- convex hull
- minmax regret