Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty.
Andrea RaithMarie SchmidtAnita SchöbelLisa ThomPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- combinatorial optimization
- multi objective
- combinatorial optimization problems
- robust optimization
- metaheuristic
- simulated annealing
- traveling salesman problem
- mathematical programming
- evolutionary algorithm
- combinatorial problems
- optimization problems
- branch and bound algorithm
- branch and bound
- multi objective optimization
- estimation of distribution algorithms
- hard combinatorial optimization problems
- memetic algorithm
- genetic algorithm
- nsga ii
- vehicle routing problem
- objective function
- computer vision
- conflicting objectives
- multi objective optimization problems
- multiple objectives
- markov random field
- search algorithm
- multiobjective optimization
- quadratic assignment problem
- path relinking