A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions.
Brad D. WoodsAbraham P. PunnenTamon StephenPublished in: CoRR (2015)
Keyphrases
- traveling salesman problem
- hamiltonian cycle
- minimum spanning tree
- transportation networks
- ant colony optimization
- combinatorial optimization
- combinatorial problems
- optimization problems
- ant colony optimization algorithm
- traveling salesman
- genetic local search
- valid inequalities
- vehicle routing problem
- discrete particle swarm optimization
- discrete optimization problems
- graph matching
- combinatorial optimization problems
- graph theory
- neural network
- decision problems
- search space
- lower bound
- search algorithm
- objective function