Pearson Nicholas A.

Nicholas A. Pearson

Information about the author Nicholas A. Pearson will soon be added to the site.
Found 3 papers in total
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Exploiting planarity in separation routines for the symmetric traveling salesman problem
2008
At present, the most successful approach for solving large-scale instances of the...
Good triangulations yield good tour
Good triangulations yield good tour
2008
Consider the following heuristic for planar Euclidean instances of the traveling...
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
A fast algorithm for minimum weight odd circuits and cuts in planar graphs
2005
We give a simple O( n 3/2 log n ) algorithm for finding a minimum weight odd circuit...
Papers per page: