An approximation algorithm for interval data minmax regret combinatorial optimization problems.
Adam KasperskiPawel ZielinskiPublished in: Inf. Process. Lett. (2006)
Keyphrases
- minmax regret
- interval data
- shortest path problem
- combinatorial optimization problems
- optimization criterion
- single machine scheduling problem
- data clustering
- knapsack problem
- ant colony optimization
- metaheuristic
- combinatorial optimization
- shortest path
- dynamic programming
- simulated annealing
- exact algorithms
- k means
- optimal solution
- genetic algorithm
- cost function
- search space
- linear programming
- worst case
- upper bound
- temporal data
- np hard
- objective function