242 search results - page 2 / 49 » Approximation Algorithms for Multi-Criteria Traveling Salesm... |
IPL
2002
13 years 4 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
EUROCAST
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
ANTSW
2010
Springer
13 years 2 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
IPL
2000
13 years 4 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...