The traveling salesman problem in bounded degree graphs.
Andreas BjörklundThore HusfeldtPetteri KaskiMikko KoivistoPublished in: ACM Trans. Algorithms (2012)
Keyphrases
- traveling salesman problem
- bounded degree
- graph theoretic
- hamiltonian cycle
- combinatorial optimization
- minimum spanning tree
- bounded treewidth
- ant colony optimization
- optimization problems
- transportation networks
- combinatorial problems
- traveling salesman
- graph theory
- ant colony optimization algorithm
- discrete optimization problems
- vehicle routing problem
- crossover operator
- weighted graph
- graph structure
- np complete
- genetic algorithm