Review of bioinspired computation in combinatorial optimization by Frank Neumann and Carsten Witt.
Sven HerrmannPublished in: SIGACT News (2013)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- metaheuristic
- branch and bound algorithm
- mathematical programming
- optimization problems
- branch and bound
- combinatorial problems
- conceptual clustering
- biologically inspired
- quadratic assignment problem
- boundary conditions
- memetic algorithm
- vehicle routing problem
- single machine scheduling problem
- graph theory
- path relinking
- combinatorial search
- neural network
- max flow min cut
- exact algorithms
- finite element
- dynamic programming
- special case
- search space
- machine learning