Results 1  10
of
4,808
• Asymmetric TSP
, 1152
"... This is a short summary of recent improvements on the explicit inapproximability bounds for the instances of metric TSP. It aims at keeping track of the best known explicit bounds for that problem as well as new techniques for proving them. All explicit inapproximability bounds are under the usual c ..."
Abstract
 Add to MetaCart
This is a short summary of recent improvements on the explicit inapproximability bounds for the instances of metric TSP. It aims at keeping track of the best known explicit bounds for that problem as well as new techniques for proving them. All explicit inapproximability bounds are under the usual
Construction heuristics for the asymmetric TSP
 European Journal of Operational Research
, 2000
"... NonEuclidean TSP construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive efforts devoted to studying Euclidean TSP construction heuristics. This state of affairs is at odds with the fact that asymmetri ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
NonEuclidean TSP construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive efforts devoted to studying Euclidean TSP construction heuristics. This state of affairs is at odds with the fact
On Approximating Asymmetric TSP and Related Problems
, 2006
"... In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds, th ..."
Abstract
 Add to MetaCart
In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds
Generalized Asymmetric Partition Crossover (GAPX) for the Asymmetric TSP
"... The Generalized Partition Crossover (GPX) constructs new solutions for the Traveling Salesman Problem (TSP) by finding recombining partitions with one entry and one exit in the graph composed by the union of two parent solutions. If there are k recombining partitions in the union graph, 2k−2 soluti ..."
Abstract
 Add to MetaCart
solutions are simultaneously exploited by GPX. Generalized Asymmetric Partition Crossover (GAPX) is introduced; it finds more recombining partitions and can also find partitions for the asymmetric TSP. GAPX does this by locating partitions that cut vertices of degree 4 in the union graph and by finding
Logarithmic Bounds on an Algorithm for Asymmetric TSP
, 2005
"... In 1982 Frieze, Galbiati and Maffioli (Networks 12:2339) published their famous algorithm for approximating the TSP tour in an asymmetric graph with triangle inequality. They show that the algorithm approximates the TSP tour within a factor of log 2 n. We construct a family of graphs for which the ..."
Abstract
 Add to MetaCart
In 1982 Frieze, Galbiati and Maffioli (Networks 12:2339) published their famous algorithm for approximating the TSP tour in an asymmetric graph with triangle inequality. They show that the algorithm approximates the TSP tour within a factor of log 2 n. We construct a family of graphs for which
Construction heuristics and domination analysis for the asymmetric TSP
 European J. Oper. Res
, 2001
"... NonEuclidean TSP construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive eorts devoted to studying Euclidean TSP construction heuristics. Motivation for remedying this gap in the study of construction ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
NonEuclidean TSP construction heuristics, and especially asymmetric TSP construction heuristics, have been neglected in the literature by comparison with the extensive eorts devoted to studying Euclidean TSP construction heuristics. Motivation for remedying this gap in the study of construction
On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound
"... We show that an instance of traveling salesman problem (TSP) of size n with an asymmetric distance matrix can be transformed into an instance of TSP of size 2n with a symmetric distance matrix. This is an improvement over earlier transformations of this kind which triple the size of the problem. Nex ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We show that an instance of traveling salesman problem (TSP) of size n with an asymmetric distance matrix can be transformed into an instance of TSP of size 2n with a symmetric distance matrix. This is an improvement over earlier transformations of this kind which triple the size of the problem
Evaluation of the ContractorPatch Heuristic for the Asymmetric TSP
, 2000
"... In this paper we further investigate tour construction algorithms for the Asymmetric Traveling Salesman Problem (ATSP). In [1] we introduced a new algorithm, called ContractorPatch (COP). We have tested the algorithm together with other wellknown and new heuristics on a variety of families of ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper we further investigate tour construction algorithms for the Asymmetric Traveling Salesman Problem (ATSP). In [1] we introduced a new algorithm, called ContractorPatch (COP). We have tested the algorithm together with other wellknown and new heuristics on a variety of families
Worst Case Performance of Approximation Algorithm for Asymmetric TSP
, 2003
"... In 1982 Frieze, Galbiati and Maffioli [3] invented their famous algorithm for approximating the TSP tour in an asymmetric graph. They show that the algorithm approximates the TSP tour within a factor of log n. We construct a family of graphs for which the algorithm (with some implementation details ..."
Abstract
 Add to MetaCart
In 1982 Frieze, Galbiati and Maffioli [3] invented their famous algorithm for approximating the TSP tour in an asymmetric graph. They show that the algorithm approximates the TSP tour within a factor of log n. We construct a family of graphs for which the algorithm (with some implementation details
Results 1  10
of
4,808