D. Aldous, The ?(2) limit in the random assignment problem, Random Structures and Algorithms, vol.8, issue.4, pp.381-418, 2001.
DOI : 10.1002/rsa.1015

S. E. Alm and G. B. Sorkin, Exact Expectations and Distributions for the Random Assignment Problem, Combinatorics, Probability and Computing, vol.11, issue.03, pp.217-248, 2002.
DOI : 10.1017/S0963548302005114

D. Coppersmith and G. B. Sorkin, Constructive bounds and exact expectations for the random assignment problem, Random Structures and Algorithms, vol.8, issue.2, pp.133-144, 1999.
DOI : 10.1002/(SICI)1098-2418(199909)15:2<113::AID-RSA1>3.0.CO;2-S

R. Van-der-hofstad, G. Hooghiemstra, and P. Van-mieghem, Size and Weight of Shortest Path Trees with Exponential Link Weights, Combinatorics, Probability and Computing, vol.15, issue.06
DOI : 10.1017/S0963548306007802

R. Van-der-hofstad, G. Hooghiemstra, and P. Van-mieghem, The weight of the shortest path tree, Random Structures and Algorithms, vol.7, issue.3
DOI : 10.1002/rsa.20141

S. Janson, One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights, Combinatorics, Probability and Computing, vol.8, issue.4, pp.347-361, 1999.
DOI : 10.1017/S0963548399003892

S. Linusson and J. Wästlund, A proof of Parisi?s conjecture on the random assignment problem, Probability Theory and Related Fields, vol.128, issue.3, pp.419-440, 2004.
DOI : 10.1007/s00440-003-0308-9

M. Mézard and G. Parisi, Replicas and optimization, Journal de Physique Lettres, vol.46, issue.17, pp.771-778, 1985.
DOI : 10.1051/jphyslet:019850046017077100

M. Mézard and G. Parisi, Mean-Field Equations for the Matching and the Travelling Salesman Problems, Europhysics Letters (EPL), vol.2, issue.12, pp.913-918, 1986.
DOI : 10.1209/0295-5075/2/12/005

M. Mézard and G. Parisi, On the solution of the random link matching problems, Journal de Physique, vol.48, issue.9, pp.1451-1459, 1987.
DOI : 10.1051/jphys:019870048090145100

C. Nair, B. Prabhakar, and M. Sharma, Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/SFCS.2003.1238191

B. Olin, Asymptotic properties of the random assignment problem, 1992.

G. Parisi, A conjecture on random bipartite matching, arXiv:cond-mat, 1998.

D. W. Walkup, On the Expected Value of a Random Assignment Problem, SIAM Journal on Computing, vol.8, issue.3, pp.440-442, 1979.
DOI : 10.1137/0208036