Results 1  10
of
88,208
The Asymmetric Traveling Salesman Problem ATSP and
"... The Asymmetric Traveling Salesman Problem ATSP as well as a the Asymmetric MultiStopover Problem AMSP (also MultiDestination Problem), is intractable (NPhard). However, using the fastest optimal path algorithms combined with the fastest permutation method enables the realtime solution for proble ..."
Abstract
 Add to MetaCart
The Asymmetric Traveling Salesman Problem ATSP as well as a the Asymmetric MultiStopover Problem AMSP (also MultiDestination Problem), is intractable (NPhard). However, using the fastest optimal path algorithms combined with the fastest permutation method enables the realtime solution
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
"... We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the HeldKarp linear programming relaxation has bounded orientable genus. 1 ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the HeldKarp linear programming relaxation has bounded orientable genus. 1
A Polyhedral Study of the Asymmetric Travelling Salesman Problem with Time Windows
, 1997
"... The asymmetric travelling salesman problem with time windows (ATSPTW) is a basic ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
The asymmetric travelling salesman problem with time windows (ATSPTW) is a basic
Approximate pareto curves for the asymmetric traveling salesman problem
, 2007
"... We present a randomized approximation algorithm for the asymmetric traveling salesman problem (ATSP) with several objective functions. Our algorithm achieves an approximation ratio of log n+ε for multicriteria ATSP with triangle 1 inequality and an approximation ratio of 1−γ + ε for multicriteria ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a randomized approximation algorithm for the asymmetric traveling salesman problem (ATSP) with several objective functions. Our algorithm achieves an approximation ratio of log n+ε for multicriteria ATSP with triangle 1 inequality and an approximation ratio of 1−γ + ε for multi
The Online Asymmetric Traveling Salesman Problem 1
"... We consider two online versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+√5 2competitive algorithm and prove that this is best possible. For the nomadic ..."
Abstract
 Add to MetaCart
We consider two online versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+√5 2competitive algorithm and prove that this is best possible. For the nomadic
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
 IN: STACS ’12. LIPICS
, 2012
"... We give a very simple approximation algorithm for the maximum asymmetric traveling salesman problem. The approximation guarantee of our algorithm is 2/3, which matches the best known approximation guarantee by Kaplan, Lewenstein, Shafrir and Sviridenko. Our algorithm is simple to analyze, and contra ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We give a very simple approximation algorithm for the maximum asymmetric traveling salesman problem. The approximation guarantee of our algorithm is 2/3, which matches the best known approximation guarantee by Kaplan, Lewenstein, Shafrir and Sviridenko. Our algorithm is simple to analyze
The online asymmetric traveling salesman problem
 Proc. 9th Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science
, 2005
"... Abstract. We consider two online versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+√5competitive algorithm and prove that this is best 2 possible. For th ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Abstract. We consider two online versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+√5competitive algorithm and prove that this is best 2 possible
Iterative Patching and the Asymmetric Traveling Salesman Problem
"... SOM theme A The human and technical side of production: the management of interdependencies Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. In this paper, we investigate iterative patc ..."
Abstract
 Add to MetaCart
patching, a technique in which a fixed patching procedure is applied at each node of the BnB search tree for the Asymmetric Traveling Salesman Problem. Computational experiments show that iterative patching results in general in search trees that are smaller than the usual classical BnB trees
A randomized rounding algorithm for the asymmetric traveling salesman problem
, 2009
"... We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like several existing algorithms, it achieves approximation ratio O(log n). Unlike previous algorithms, it uses randomized rounding. 1 ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present an algorithm for the asymmetric traveling salesman problem on instances which satisfy the triangle inequality. Like several existing algorithms, it achieves approximation ratio O(log n). Unlike previous algorithms, it uses randomized rounding. 1
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
 Mathematics of Operations Research
, 2006
"... informs ® doi 10.1287/moor.1060.0191 ..."
Results 1  10
of
88,208