Output-sensitive Complexity of Multiobjective Combinatorial Optimization.
Fritz BöklerMatthias EhrgottChristopher MorrisPetra MutzelPublished in: CoRR (2016)
Keyphrases
- combinatorial optimization
- multi objective
- combinatorial optimization problems
- traveling salesman problem
- artificial bee colony
- simulated annealing
- metaheuristic
- evolutionary algorithm
- optimization problems
- branch and bound
- optimization algorithm
- multiobjective optimization
- mathematical programming
- hard combinatorial optimization problems
- multi objective optimization
- graph theory
- branch and bound algorithm
- combinatorial problems
- genetic algorithm
- memetic algorithm
- worst case
- multiobjective evolutionary algorithms
- vehicle routing problem
- exact algorithms
- combinatorial search
- path relinking
- objective function
- quadratic assignment problem
- job shop scheduling problem
- multiple objectives
- computational complexity
- nsga ii
- ant colony optimization
- max flow min cut