Bioinspired computation in combinatorial optimization: algorithms and their computational complexity.
Carsten WittPublished in: GECCO (Companion) (2014)
Keyphrases
- combinatorial optimization
- computational complexity
- combinatorial optimization problems
- optimization problems
- simulated annealing
- metaheuristic
- exact algorithms
- combinatorial problems
- computational cost
- high computational complexity
- branch and bound
- computationally efficient
- traveling salesman problem
- branch and bound algorithm
- graph theory
- computational efficiency
- genetic algorithm
- estimation of distribution algorithms
- max flow min cut
- hard combinatorial optimization problems
- mathematical programming
- tabu search
- np hard
- learning algorithm
- biologically inspired
- shortest path
- np complete