2004
DOI: 10.1017/s0963548303005819
|View full text |Cite
|
Sign up to set email alerts
|

Random Assignment with Integer Costs

Abstract: The random assignment problem is to minimize the cost of an assignment in a n × n matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider both uniform distributions on 1, 2,. .. , m, for m = n or n 2 , and random permutations of 1, 2,. .. , n for each row, or of 1, 2,. .. , n 2 for the whole matrix. We find the limit of the expected cost for the "n 2 " cases, and prove bounds for the "n" cases. This is done by simple coupling arguments together with A… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 13 publications
0
11
0
Order By: Relevance
“…An immediate benefit of such an assumption is that all feasible solutions can be considered to have (almost surely) different costs. An interesting departure from this general setup is found in the paper by Parviainen (2004), where an LAP with discretely distributed random assignment costs is discussed. Making use of some of the results of Aldous (2001), Parviainen considers the following cases of random LAP (1):…”
Section: Lap With Discrete Random Costsmentioning
confidence: 99%
See 1 more Smart Citation
“…An immediate benefit of such an assumption is that all feasible solutions can be considered to have (almost surely) different costs. An interesting departure from this general setup is found in the paper by Parviainen (2004), where an LAP with discretely distributed random assignment costs is discussed. Making use of some of the results of Aldous (2001), Parviainen considers the following cases of random LAP (1):…”
Section: Lap With Discrete Random Costsmentioning
confidence: 99%
“…Then, Parviainen (2004) shows that the limiting expected optimal value E½L ðÁÞ ¼ lim n!1 E½L ðÁÞ n of the random LAP with the described above structure of the cost matrix satisfies:…”
Section: Lap With Discrete Random Costsmentioning
confidence: 99%
“…M is also the bijective mapping of the MPHF being built. Since G fits Parviainen's proposed "Case II" (Parviainen 2004), M has weight approximately 1.83n, asymptotically, which was determined experimentally.…”
Section: A 183n Mphf Constructionmentioning
confidence: 54%
“…Buck et al [17] conjecture an explicit formula for the expected value of the random k-assignment. Parviainen [18] discusses an assignment problem with discrete random costs. Li et al [19] present a new genetic algorithm selection scheme to solve the random assignment problem.…”
Section: Introductionmentioning
confidence: 99%
“…Assumption(coefficient) Mathematical model deterministic model [1][2][3][4][5][6][7][8][9][10][11][12] constant integer programming random model [13][14][15][16][17][18][19][20][21] independent random variable stochastic programming uncertain model [27] independent uncertain variable uncertain programming our model independent uncertain variable and independent random variable uncertain random programming…”
Section: Introductionmentioning
confidence: 99%