594 search results - page 40 / 119 » Travelling Miser Problem |
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...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
ICLP
1997
Springer
13 years 12 months 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...
MP
2007
13 years 7 months ago
2007
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...