The selective travelling salesman problem (STSP) appears in various applications. The paper presents a new version of this problem called the selective travelling salesman problem on a road network (R-STSP). While in the classical STSP a graph is complete and each vertex can be visited at most once, in R-STSP these two constraints are not obligatory which makes the problem more real-life and ap...

We design a new LP-based algorithm for the graphic s-t path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Sebő.

We describe how to use the traveling salesman problem (TSP) to create continuous line drawings of target pictures.

The probabilistic traveling salesman problem (PTSP) was introduced by Jaillet [6] as an extension of the classical traveling salesman problem (TSP). In the PTSP, the salesman does not necessarily have to visit every node, but a probability of requiring a visit is given for each node. The goal is to find an a-priori tour that includes every node and minimizes the expected length of an a-posterio...

OF THESIS GENERALIZED PARTITION CROSSOVER FOR THE TRAVELING SALESMAN

by Howard Kleiman

We present a new method of identifying a class of asymmetric matrices for which an optimal traveling salesman tour exists that is pyramidal. The new class generalizes two previously known classes of matrices and includes some new matrices as well. © 2006 Elsevier B.V. All rights reserved.