Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty.
Andrew MastinPatrick JailletSang ChinPublished in: CoRR (2014)
Keyphrases
- combinatorial optimization
- minmax regret
- combinatorial optimization problems
- single machine scheduling problem
- interval data
- metaheuristic
- traveling salesman problem
- optimization problems
- shortest path problem
- branch and bound algorithm
- simulated annealing
- exact algorithms
- branch and bound
- combinatorial problems
- optimization criterion
- vehicle routing problem
- knapsack problem
- ant colony optimization
- evolutionary algorithm