Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.
Hassene AissiPublished in: 4OR (2006)
Keyphrases
- min max
- combinatorial optimization problems
- knapsack problem
- optimization problems
- combinatorial optimization
- multiobjective optimization
- discrete optimization
- max min
- ant colony optimization
- metaheuristic
- traveling salesman problem
- approximation algorithms
- shortest path problem
- online learning
- job shop scheduling
- high resolution
- exact algorithms
- evolutionary algorithm
- job shop scheduling problem
- lower bound
- vehicle routing problem
- special case
- continuous optimization problems
- minmax regret