332 search results - page 25 / 67 » Traveling salesman path problems |
ICLP
1997
Springer
14 years 17 hour ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
COR
2008
13 years 8 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
TCS
2008
13 years 7 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
IPL
2000
13 years 7 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...