Bioinspired computation in combinatorial optimization: algorithms and their computational complexity.
Frank NeumannCarsten WittPublished in: GECCO (Companion) (2013)
Keyphrases
- combinatorial optimization
- computational complexity
- combinatorial optimization problems
- optimization problems
- traveling salesman problem
- simulated annealing
- metaheuristic
- special case
- branch and bound
- computational cost
- graph theory
- combinatorial problems
- branch and bound algorithm
- computationally efficient
- artificial bee colony
- evolutionary algorithm
- high computational complexity
- computational efficiency
- mathematical programming
- path relinking
- worst case
- memetic algorithm
- benchmark problems
- search algorithm