A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Solution for a bipartite Euclidean traveling-salesman problem in one dimension

2018
*
Physical review. E
*

The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We

doi:10.1103/physreve.97.052109
pmid:29906886
fatcat:pubbjws6breehpex2mdxgoesei