A double oracle approach to minmax regret optimization problems with interval data.
Hugo GilbertOlivier SpanjaardPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- minmax regret
- interval data
- optimization problems
- combinatorial optimization problems
- shortest path problem
- evolutionary algorithm
- metaheuristic
- temporal data
- data clustering
- objective function
- cost function
- traveling salesman problem
- combinatorial optimization
- optimization criterion
- knapsack problem
- benchmark problems
- multivariate data
- multi objective optimization
- search space
- data streams
- temporal information
- shortest path
- multi objective