Sciweavers

40 search results - page 2 / 8
» The On-line Asymmetric Traveling Salesman Problem
Sort
View
NMA
2010
13 years 5 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
SODA
2010
ACM
168views Algorithms» more  SODA 2010»
14 years 4 months ago
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
IPCO
1992
115views Optimization» more  IPCO 1992»
13 years 8 months ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
SODA
2010
ACM
186views Algorithms» more  SODA 2010»
13 years 5 months ago
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 4 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...