Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints.
Christina BüsingSabrina SchmitzPublished in: Discret. Appl. Math. (2024)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- discrete optimization
- optimization problems
- ant colony optimization
- metaheuristic
- job shop scheduling
- traveling salesman problem
- job shop scheduling problem
- consistency constraints
- minmax regret
- min cost
- shortest path problem
- search algorithm
- simulated annealing
- exact algorithms
- upper bound
- estimation of distribution algorithms
- decision variables
- optimal solution
- objective function
- continuous optimization problems
- neural network