Min-max and min-max regret versions of combinatorial optimization problems: A survey.
Hassene AissiCristina BazganDaniel VanderpootenPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- min max
- combinatorial optimization problems
- knapsack problem
- combinatorial optimization
- metaheuristic
- discrete optimization
- optimization problems
- ant colony optimization
- max min
- multiobjective optimization
- job shop scheduling
- continuous optimization problems
- job shop scheduling problem
- traveling salesman problem
- minmax regret
- vehicle routing problem
- exact algorithms
- min cost
- branch and bound
- particle swarm optimization
- online learning
- lower bound
- shortest path
- simulated annealing
- scheduling problem
- multi objective
- evolutionary algorithm
- confidence bounds