Two-stage combinatorial optimization problems under risk.
Marc GoerigkAdam KasperskiPawel ZielinskiPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- optimization problems
- combinatorial optimization
- discrete optimization
- metaheuristic
- ant colony optimization
- traveling salesman problem
- job shop scheduling
- shortest path problem
- risk assessment
- continuous optimization problems
- simulated annealing
- decision making
- min cost
- risk factors
- vehicle routing problem
- job shop scheduling problem
- risk management
- special case
- branch and bound
- objective function
- interval data