A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty.
Taehan LeeChanghyun KwonPublished in: 4OR (2014)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- metaheuristic
- optimization problems
- ant colony optimization
- job shop scheduling
- discrete optimization
- robust optimization
- traveling salesman problem
- shortest path problem
- search space
- uncertain data
- vehicle routing problem
- exact algorithms
- min cost
- continuous optimization problems
- job shop scheduling problem
- branch and bound algorithm
- multi objective
- evolutionary algorithm
- genetic algorithm
- minmax regret