Join Our Newsletter

SODA

2010

ACM

9 years 23 days ago
2010

ACM

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...

PPSN

2010

Springer

9 years 24 days ago
2010

Springer

We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...

MP

2010

9 years 25 days ago
2010

The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is deﬁned on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...

IPL

2000

9 years 2 months ago
2000

We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...

NCA

2008

IEEE

9 years 2 months ago
2008

IEEE

The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...

IPL

2008

9 years 2 months ago
2008

We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...

EOR

2006

9 years 2 months ago
2006

The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...

CSJM

2006

9 years 2 months ago
2006

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 TS...

ENDM

2010

9 years 2 months ago
2010

Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...

DISOPT

2010

9 years 2 months ago
2010

In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...