A proof of Parisi’s conjecture on the random assignment problem
- 26 November 2003
- journal article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 128 (3) , 419-440
- https://doi.org/10.1007/s00440-003-0308-9
Abstract
No abstract availableKeywords
All Related Versions
This publication has 14 references indexed in Scilit:
- On the expected value of the minimum assignmentRandom Structures & Algorithms, 2002
- Exact Expectations and Distributions for the Random Assignment ProblemCombinatorics, Probability and Computing, 2002
- The ζ(2) limit in the random assignment problemRandom Structures & Algorithms, 2001
- Certain expected values in the random assignment problemOperations Research Letters, 1993
- On the expected optimal value of random assignment problems: Experimental results and open questionsComputational Optimization and Applications, 1993
- Asymptotics in the random assignment problemProbability Theory and Related Fields, 1992
- On random minimum length spanning treesCombinatorica, 1989
- On the value of a random minimum spanning tree problemDiscrete Applied Mathematics, 1985
- Replicas and optimizationJournal de Physique Lettres, 1985
- On the Expected Value of a Random Assignment ProblemSIAM Journal on Computing, 1979