332 search results - page 26 / 67 » Traveling salesman path problems |
CEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
ENDM
2010
13 years 8 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
IPPS
2002
IEEE
14 years 24 days ago
2002
IEEE
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
APNOMS
2006
Springer
13 years 11 months ago
2006
Springer
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...