Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty.
Andrew MastinPatrick JailletSang ChinPublished in: ISAAC (2015)
Keyphrases
- combinatorial optimization
- minmax regret
- combinatorial optimization problems
- single machine scheduling problem
- interval data
- metaheuristic
- traveling salesman problem
- branch and bound algorithm
- simulated annealing
- branch and bound
- optimization problems
- shortest path problem
- exact algorithms
- combinatorial problems
- optimization criterion
- ant colony optimization
- genetic algorithm
- vehicle routing problem
- resource allocation problems
- knapsack problem
- max flow min cut
- probability distribution
- evolutionary algorithm
- search algorithm