Results 1  10
of
8,017
Traveling Salesman Problem
, 1976
"... An algorithm for solving a range constrained traveling salesman problem. ..."
The traveling salesman problem
, 1994
"... This paper presents a selfcontained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances ..."
Abstract

Cited by 130 (5 self)
 Add to MetaCart
This paper presents a selfcontained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem
Travelling Salesman Problem
"... The "Travelling Salesman Problem" is briefly presented, with reference to problems that can be assimilated to it and solved by the same technique. Examples are shown and solved. ..."
Abstract
 Add to MetaCart
The "Travelling Salesman Problem" is briefly presented, with reference to problems that can be assimilated to it and solved by the same technique. Examples are shown and solved.
Ant colonies for the travelling salesman problem
, 1997
"... We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer si ..."
Abstract

Cited by 286 (5 self)
 Add to MetaCart
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer
On the Solution of Traveling Salesman Problems
 DOC. MATH. J. DMV
, 1998
"... Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TS ..."
Abstract

Cited by 225 (7 self)
 Add to MetaCart
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of M. Grötschel , S. Hong , M. Jünger , P. Miliotis , D. Naddef , M. Padberg ... some of its refinements that led to the solution of a 13,509city instance.
On the Bipartite Travelling Salesman Problem
, 1998
"... We consider a production planning problem which combines an assignment problem with a travelling salesman problem (TSP). The most interesting special case is a symmetric TSP in a bipartite graph. For this problem we find a 2factor approximation algorithm if the distances obey a bipartite analogue o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider a production planning problem which combines an assignment problem with a travelling salesman problem (TSP). The most interesting special case is a symmetric TSP in a bipartite graph. For this problem we find a 2factor approximation algorithm if the distances obey a bipartite analogue
Traveling Salesman Problem with Transportation ∗
"... Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cuttingplane methods and Branch and Bound ..."
Abstract
 Add to MetaCart
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cuttingplane methods and Branch
On The Approximability Of The Traveling Salesman Problem
 Proceedings of the 32nd Annual ACM Symposium on Theory of Computing
, 2000
"... We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than 116 when the edge lengths are allowed to be asymmetric and 219 when the edge lengths are symmetric. The best previous lower bounds were 2804 and 3812 respectively. The reduction is fr ..."
Abstract

Cited by 41 (0 self)
 Add to MetaCart
We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than 116 when the edge lengths are allowed to be asymmetric and 219 when the edge lengths are symmetric. The best previous lower bounds were 2804 and 3812 respectively. The reduction
The Generalized Traveling Salesman Problem
"... The Generalized Traveling Salesman Problem (GTSP) is an extension of the wellknown Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant Colony ..."
Abstract
 Add to MetaCart
The Generalized Traveling Salesman Problem (GTSP) is an extension of the wellknown Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant
The Railway Traveling Salesman Problem ⋆
"... Abstract. We consider the Railway Traveling Salesman Problem (RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an ..."
Abstract
 Add to MetaCart
Abstract. We consider the Railway Traveling Salesman Problem (RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP
Results 1  10
of
8,017