Sciweavers

613 search results - page 8 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
13 years 10 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
IPPS
1998
IEEE
13 years 11 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 9 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
MP
2010
145views more  MP 2010»
13 years 6 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
SWARM
2010
SPRINGER
219views Optimization» more  SWARM 2010»
14 years 17 days ago
Biogeography Migration Algorithm for Traveling Salesman Problem
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It is designed based on the migration strategy of animals to solve the...
Hongwei Mo, Lifang Xu