51 search results - page 2 / 11 » On Random Symmetric Travelling Salesman Problems |
DISOPT
2006
14 years 10 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...
EOR
2006
14 years 10 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
MOR
2010
14 years 8 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
DISOPT
2008
14 years 10 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
ICEC
1996
14 years 11 months ago
1996
