Computing and minimizing the relative regret in combinatorial optimization with interval data.
Igor AverbakhPublished in: Discret. Optim. (2005)
Keyphrases
- combinatorial optimization
- interval data
- combinatorial optimization problems
- minmax regret
- shortest path problem
- metaheuristic
- traveling salesman problem
- simulated annealing
- branch and bound algorithm
- optimization problems
- branch and bound
- combinatorial problems
- single machine scheduling problem
- data clustering
- exact algorithms
- genetic algorithm
- temporal data
- shortest path
- lower bound
- vehicle routing problem
- knapsack problem
- pairwise
- data analysis
- optimization criterion
- reinforcement learning
- neural network
- max flow min cut