42 search results - page 1 / 9 » The Traveling Salesman Problem for Cubic Graphs |
COCOON
2007
Springer
13 years 10 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
JGAA
2007
13 years 4 months ago
2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
DISOPT
2006
13 years 4 months ago
2006
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
JCO
1998
13 years 4 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
ANTSW
2010
Springer
13 years 2 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...