liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Exact formulas and limits for a class of random optimization problems
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
2005 (English)Report (Other academic)
Abstract [en]

We obtain an exact formula for the expected value of the optimum for a certain class of random combinatorial optimization problems on bipartite graphs. By applying this formula, we compute the limit as n → ∞ of the expected value of the minimum 2-factor in the complete bipartite graph Kn,n with independent exp(1) edge costs. This limit, approximately 4.0831, is conjectured to be twice the value obtained non-rigorously by W. Krauth, M. M´ezard and G. Parisi for the minimum travelling salesman tour on the complete graph.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press , 2005. , 17 p.
Linköping Studies in Mathematics, ISSN 1652-4454 (online), 0348-2960 (print) ; 5
National Category
URN: urn:nbn:se:liu:diva-62949OAI: diva2:375250
Available from: 2005-08-30 Created: 2010-12-07Bibliographically approved

Open Access in DiVA

Exact formulas and limits for a class of random optimization problems(201 kB)678 downloads
File information
File name FULLTEXT01.pdfFile size 201 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Wästlund, Johan
By organisation
Applied MathematicsThe Institute of Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 678 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 162 hits
ReferencesLink to record
Permanent link

Direct link