Results 121 to 130 of about 232 (135)

Traveling salesman problem under categorization

Operations Research Letters, 1992
We introduce two new classes of traveling salesman problems (TSP1 and TSP2) which subsume the classical traveling salesman problem and the bottleneck traveling salesman problem.
Abraham P Punnen
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Minimax 2-connected subgraphs and the bottleneck traveling salesman problem

Cybernetics and Systems Analysis, 1980
exaly   +3 more sources

Guaranteed performance heuristics for the bottleneck travelling salesman problem

Operations Research Letters, 1984
We consider constant-performance, polynomial-time, nonexact algorithms for the minimax or bottleneck version of the Travelling Salesman Problem. It is first shown that no such algorithm can exist for problems with arbitrary costs unless P = NP. However, when costs are positive and satisfy the triangle inequality, we use results pertaining to the ...
Parker, R. Gary, Rardin, Ronald L.
openaire   +1 more source

A data-guided lexisearch algorithm for the bottleneck travelling salesman problem

International Journal of Operational Research, 2011
The bottleneck travelling salesman problem is to find a Hamiltonian circuit that minimises the maximum arc length in a graph. We first modify an existing lexisearch algorithm by incorporating good upper and lower bounds to obtain exact optimal solution to the problem. Then we present a data-guided lexisearch algorithm.
openaire   +1 more source

A Quantum Algorithm for the Bottleneck Travelling Salesman Problem

This thesis presents the development and analysis of a quantum algorithm tailored for solving the decision problem variant of the Bottleneck Travelling Salesman Problem (BTSP). The decision problem asks whether there exists a Hamiltonian cycle such that no edge weight within the cycle is less than a specified value (α).
openaire   +1 more source

The Bottleneck Traveling Salesman Problem

Journal of the ACM, 1978
Robert S. Garfinkel, K. C. Gilbert
openaire   +1 more source

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

ACM Transactions on Algorithms, 2021
Hyung-Chan An, Robert Kleinberg, David B Shmoys   +2 more
exaly  

An approximation algorithm for a bottleneck traveling salesman problem

Journal of Discrete Algorithms, 2009
Ming-Yang Kao
exaly  

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics

European Journal of Operational Research, 2020
Pouya Baniasadi, Mehdi Foumani, Kate Smith-Miles   +2 more
exaly  

TSPLIB—A Traveling Salesman Problem Library

ORSA Journal on Computing, 1991
Gerhard Reinelt
exaly