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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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.
Series
Linköping Studies in Mathematics, ISSN 0348-2960, E-ISSN 1652-4454 ; 5
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-62949OAI: oai:DiVA.org:liu-62949DiVA: diva2:375250
Available from: 2005-08-30 Created: 2010-12-07 Last updated: 2017-04-11Bibliographically approved

Open Access in DiVA

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

Authority records BETA

Wästlund, Johan

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 704 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

urn-nbn

Altmetric score

urn-nbn
Total: 279 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf