On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data.
Adam KasperskiPawel ZielinskiPublished in: Oper. Res. Lett. (2007)
Keyphrases
- minmax regret
- interval data
- combinatorial optimization problems
- shortest path problem
- optimization problems
- knapsack problem
- combinatorial optimization
- metaheuristic
- ant colony optimization
- data clustering
- temporal data
- optimization criterion
- single machine scheduling problem
- approximation algorithms
- exact algorithms
- vehicle routing problem
- multivariate data
- traveling salesman problem
- clustering method