Random assignment with integer costs

Combinatorics Probability and Computing

Volumn 13, Issue 1, 2004, Pages 103-113

  Parviainen, Robert ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; COSTS; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

PERMUTATION; RANDOM ASSIGNMENT;

COMBINATORIAL MATHEMATICS;

EID: 3142637251     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005819     Document Type: Article

References (16)

1. Aldous, D. J. (1992) Asymptotics in the random assignment problem. Probab. Theory Rel. Fields 93 507-534.
2. Aldous, D. J. (2001) The ζ(2) limit in the random assignment problem. Random Struct. Alg. 18 381-418.
3. Alm, S. E. and Sorkin, G. B. (2002) Exact expectations and distributions in the random assignment problem. Combin. Probab. Comput. 11 217-248.
4. Coppersmith, D. and Sorkin, G. B. (1999) Constructive bounds and exact expectations for the random assignment problem. Random Struct. Alg. 15 113-144.
5. Dell'Amico, M. and Toth, P. (2000) Algorithms and codes for dense assignment problems: The state of the art. Discrete Appl. Math. 100 17-48.
6. Durrett, R. (1995) Probability: Theory and Examples, Duxbury Press.
7. Frieze, A. M. and Sorkin, G. B. (2001) The probabilistic relationship between the assignment and asymmetric traveling salesman problems. In Proc. SODA, pp. 652-660.
8. Gut, A. (1995) An Intermediate Course in Probability, Springer.
9. Janson, S. (2001) Personal communication.
10. Jonker, R. and Volgenant, A. A. (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38 325-340.
11. Lee, S. and Su, Z. (2002) On the fluctuation in the random assignment problem. Comm. Korean Math. Soc. 39 321-330.
12. Linusson, S. and Wästlund, J. (2000) A generalization of the random assignment problem. Mathematics arxiv, http://arxiv.org/ps/math/0006146.
13. Mézard, M. and Parisi, G. (1985) Replicas and optimization. Journal de Physiques Lettres 46 771-778.
14. Mézard, M. and Parisi, G. (1987) On the solution of the random link matching problem. Journal de Physiques Lettres 48 1451-1459.
15. Olin, B. (1992) Asymptotic properties of random assignment problems. PhD thesis, Kungliga Tekniska Högskolan, Stockholm, Sweden.
16. Parisi, G. (1998) A conjecture on random bipartite matching. Preprint cond-mat/9801176 at xxx.lanl.gov.