Sciweavers

DISOPT
2008
93views more  DISOPT 2008»
14 years 16 days ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
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...
Adam N. Letchford, Nicholas A. Pearson