Sciweavers

613 search results - page 21 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
13 years 9 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
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...
Lukasz Kowalik, Marcin Mucha
IPL
2000
146views more  IPL 2000»
13 years 7 months ago
Better approximations for max TSP
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...
Refael Hassin, Shlomi Rubinstein
IPPS
2005
IEEE
14 years 1 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq
APNOMS
2006
Springer
13 years 11 months ago
GISness System for Fast TSP Solving and Supporting Decision Making
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...
Iwona Pozniak-Koszalka, Ireneusz Kulaga, Leszek Ko...