On computational complexity of the constructive-optimizer neural network for the traveling salesman problem.
Mehdi Saadatmand TarzjanPublished in: Neurocomputing (2018)
Keyphrases
- traveling salesman problem
- neural network
- computational complexity
- ant colony optimization
- combinatorial optimization
- combinatorial problems
- ant colony optimization algorithm
- optimization problems
- artificial neural networks
- discrete optimization problems
- valid inequalities
- np complete
- genetic algorithm
- special case
- hamiltonian cycle
- traveling salesman
- crossover operator
- combinatorial optimization problems
- transportation networks
- decision problems
- np hard
- genetic local search
- optimization algorithm
- vehicle routing problem
- dynamic programming
- nature inspired
- global optimization
- discrete particle swarm optimization
- query processing