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 available. 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 EN=1πlogN for large number of points 2N. As a by-product of our analysis, also the loop covering problem has the same optimal average cost. We also explain why this result cannot be extended to higher dimensions. We numerically check the exact predictions.
Exact value for the average optimal cost of the bipartite traveling salesman and two-factor problems in two dimensions / R. Capelli, S. Caracciolo, A. DI GIOACCHINO, E.M. Malatesta. - In: PHYSICAL REVIEW. E. - ISSN 2470-0045. - 98:3(2018 Sep 27), pp. 030101.030101-1-030101.030101-5.
|Titolo:||Exact value for the average optimal cost of the bipartite traveling salesman and two-factor problems in two dimensions|
CAPELLI, RICCARDO (Primo) (Corresponding)
CARACCIOLO, SERGIO (Secondo)
DI GIOACCHINO, ANDREA (Penultimo)
MALATESTA, ENRICO MARIA (Ultimo)
|Parole Chiave:||Physics - Disordered Systems and Neural Networks; Physics - Disordered Systems and Neural Networks; Statistical and Nonlinear Physics; Statistics and Probability; Condensed Matter Physics|
|Settore Scientifico Disciplinare:||Settore FIS/02 - Fisica Teorica, Modelli e Metodi Matematici|
|Progetto:||Human Brain Project Specific Grant Agreement 1 (HBP SGA1)|
Human Brain Project Specific Grant Agreement 2 (HBP SGA2)
|Data di pubblicazione:||27-set-2018|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1103/PhysRevE.98.030101|
|Appare nelle tipologie:||01 - Articolo su periodico|