Constructive bounds and exact expectations for the random assignment problem
- 1 September 1999
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 15 (2) , 113-144
- https://doi.org/10.1002/(sici)1098-2418(199909)15:2<113::aid-rsa1>3.0.co;2-s
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Average Case Analysis of a Heuristic for the Assignment ProblemMathematics of Operations Research, 1994
- 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
- A Lower Bound on the Expected Cost of an Optimal AssignmentMathematics of Operations Research, 1993
- Asymptotics in the random assignment problemProbability Theory and Related Fields, 1992
- On linear programs with random costsMathematical Programming, 1986
- Replicas and optimizationJournal de Physique Lettres, 1985
- On the Expected Value of a Random Assignment ProblemSIAM Journal on Computing, 1979
- On Approximation Methods for the Assignment ProblemJournal of the ACM, 1962
- A Combinatorial AlgorithmJournal of the London Mathematical Society, 1946