In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes.
Dec 7, 2015
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path.
People also ask
What is maximum scatter traveling salesman problem?
What is the maximum traveling salesman problem?
What is the largest solved Travelling salesman problem?
What is the problem on Travelling salesman?
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path.
Abstract. We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour ...
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path.
Missing: Traveling Salesperson
This paper is concerned with a variant of the traveling salesman problem (TSP) called the maximum scatter traveling salesman problem (MSTSP).
Missing: Salesperson | Show results with:Salesperson
This "maximum scatter" traveling salesperson problem (TSP) is closely related to the bottleneck TSP ... Read More · Reducing Path TSP to TSP. We present a ...
The first algorithmic study of the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length ...
The problem is known as Maximum Scatter. TSP, and was introduced by Arkin et al. (SODA. 1997), motivated by applications in manufacturing and medical imaging.
The maximum scatter traveling salesman problem (MSTSP) is a variant of the well-known traveling salesman problem (TSP) where the objective is to find a ...
Missing: Salesperson | Show results with:Salesperson