Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios.
Eduardo CondePublished in: Comput. Oper. Res. (2019)
Keyphrases
- minmax regret
- combinatorial optimization problems
- interval data
- knapsack problem
- combinatorial optimization
- metaheuristic
- optimization problems
- optimization criterion
- resource allocation problems
- ant colony optimization
- resource allocation
- traveling salesman problem
- shortest path problem
- single machine scheduling problem
- exact algorithms
- evolutionary algorithm
- temporal data
- greedy algorithm
- data clustering
- shortest path
- simulated annealing
- data streams