Open Access
Translator Disclaimer
2010 The mean field traveling salesman and related problems
Johan Wästlund
Author Affiliations +
Acta Math. 204(1): 91-150 (2010). DOI: 10.1007/s11511-010-0046-7

Abstract

The edges of a complete graph on n vertices are assigned i.i.d. random costs from a distribution for which the interval [0, t] has probability asymptotic to t as t→0 through positive values. In this so called pseudo-dimension 1 mean field model, we study several optimization problems, of which the traveling salesman is the best known. We prove that, as n→∞, the cost of the minimum traveling salesman tour converges in probability to a certain number, approximately 2.0415, which is characterized analytically.

Citation

Download Citation

Johan Wästlund. "The mean field traveling salesman and related problems." Acta Math. 204 (1) 91 - 150, 2010. https://doi.org/10.1007/s11511-010-0046-7

Information

Received: 3 April 2008; Revised: 9 June 2009; Published: 2010
First available in Project Euclid: 31 January 2017

zbMATH: 1231.90370
MathSciNet: MR2600434
Digital Object Identifier: 10.1007/s11511-010-0046-7

Subjects:
Primary: 60K35
Secondary: 90C35

Rights: 2010 © Institut Mittag-Leffler

JOURNAL ARTICLE
60 PAGES


SHARE
Vol.204 • No. 1 • 2010
Back to Top