Approximation of min-max and min-max regret versions of some combinatorial optimization problems.
Hassene AissiCristina BazganDaniel VanderpootenPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- min max
- combinatorial optimization problems
- multiobjective optimization
- knapsack problem
- combinatorial optimization
- discrete optimization
- optimization problems
- metaheuristic
- max min
- ant colony optimization
- job shop scheduling
- traveling salesman problem
- continuous optimization problems
- shortest path problem
- lower bound
- online learning
- upper bound
- heuristic search
- vehicle routing problem
- job shop scheduling problem
- scheduling problem
- dynamic programming
- np hard
- optimal solution
- objective function