A Probabilistic Model for Minmax Regret in Combinatorial Optimization.
Karthik NatarajanDongjian ShiKim-Chuan TohPublished in: Oper. Res. (2014)
Keyphrases
- combinatorial optimization
- minmax regret
- probabilistic model
- combinatorial optimization problems
- single machine scheduling problem
- interval data
- metaheuristic
- simulated annealing
- traveling salesman problem
- branch and bound algorithm
- branch and bound
- combinatorial problems
- optimization problems
- shortest path problem
- exact algorithms
- optimization criterion
- bayesian networks
- vehicle routing problem
- greedy algorithm
- column generation
- data clustering
- ant colony optimization
- tabu search
- lower bound