This title appears in the Scientific Report :
2019
Please use the identifier:
http://dx.doi.org/10.1103/PhysRevE.98.030101 in citations.
Please use the identifier: http://hdl.handle.net/2128/21829 in citations.
Exact value for the average optimal cost of the bipartite traveling salesman and two-factor problems in two dimensions
Exact value for the average optimal cost of the bipartite traveling salesman and two-factor problems in two dimensions
We show that the average optimal cost for the traveling-salesman problem in two dimensions, which is the archetypal problem in combinatorial optimization, in the bipartite case, is simply related to the average optimal cost of the assignment problem with the same Euclidean, increasing, convex weight...
Saved in:
Personal Name(s): | Capelli, Riccardo (Corresponding author) |
---|---|
Caracciolo, Sergio (Corresponding author) / Di Gioacchino, Andrea (Corresponding author) / Malatesta, Enrico M. (Corresponding author) | |
Contributing Institute: |
Computational Biomedicine; IAS-5 |
Published in: | Physical Review E Physical review / E, 98 98 (2018 2018) 3 3, S. 030101 030101 |
Imprint: |
Woodbury, NY
Inst.
2018
2018-09-27 2018-09-01 |
DOI: |
10.1103/PhysRevE.98.030101 |
Document Type: |
Journal Article |
Research Program: |
ohne Topic |
Link: |
OpenAccess OpenAccess OpenAccess OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://hdl.handle.net/2128/21829 in citations.
We show that the average optimal cost for the traveling-salesman problem in two dimensions, which is the archetypal problem in combinatorial optimization, in the bipartite case, is simply related to the average optimal cost of the assignment problem with the same Euclidean, increasing, convex weights. In this way we extend a result already known in one dimension where exact solutions are avalaible. The recently determined average optimal cost for the assignment when the cost function is the square of the distance between the points provides therefore an exact prediction\overline{E_{N}} = \frac{1}{\pi} \log Nfor large number of points 2N. As a byproduct of our analysis also the loop covering problem has the same optimal average cost. We also explain why this result cannot be extended at higher dimensions. We numerically check the exact predictions. |