Abstract
In the paper, we study the expected optimal value of random linear assignment problems, whose data are random variables with the uniform and the exponential distributions. An interior point approach is used to solve large-scale dense assignment problems with size up to 10,000 nodes and 100 million edges. Our computational results indicate the validity of a long-standing conjecture about the limiting value of the expected optimal assignment. Some interesting open problems and extensions are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Adler, N.K. Karmarkar, M.G.C. Resende, and G. Veiga, “An implementation of Karmarkar algorithm for linear programming,” Math. Prog., vol. 44, pp. 297–335, 1989.
D.A. Bayer and J.C. Lagarias, “The nonlinear geometry of linear programming I, Affine and projective scaling trajectories,” Trans. Am. Math. Society, vol. 314, pp. 499–526, 1989.
W.E. Donath, “Algorithm and average-value bounds for assignment problems,” IBM J. Res. Dev., vol. 13, pp. 380–386, 1969.
J.B.G. Frenk, M. van Houweninge, and A.H.G. Rinnooy Kan, “Order statistics and the linear assignment problem,” Comput., vol. 39, pp. 165–174, 1986.
N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, pp. 373–395, 1984.
N.K. Karmarkar and K.G. Ramakrishnan, “Computational results of an interior point algorithm for large scale linear programming,” Math. Prog., vol. 52, pp. 555–586, 1991.
R.M. Karp, “An upper bound on the expected cost of an optimal assignment,” Discrete Algorithms and Complexity, Academic Press: Boston, pp. 1–4, 1987.
V.F. Kolchin, B.A. Sevastyanov, and V.P. Chistyakov, Random Allocations, Winston & Sons, Washington, 1978.
W. Krauth and M. Mézard, “The cavity method and the traveling-salesman problem,” Europhys. Lett., vol.8(3), pp. 213–218, 1989.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, The Traveling Salesman Problem, John Wiley & Sons: New York, 1985.
A.J. Lazarus, “The assignment problem with uniform (0, 1) cost matrix,” A.B. thesis, Princeton Univ., Princeton, NJ, 1979.
A.J. Lazarus “Certain expected values in the random assignment problem,” Technical report, Math. & Computer Science Dept., Univ. of California: Riverside, CA, 1990.
R. Loulou, “Average behavior of heuristic and optimal solutions to the maximization assignment problem,” Technical report, Dept. of Management, Univ. of Montreal, Canada, 1983.
I.J. Lustig, R.E. Marsten, and D.F. Shanno, “Computational experience with a primal-dual interior point method for linear programming,” Technical report, Dept. of Civ. Eng. and Oper. Res., Princeton Univ., Princeton, NJ, 1989.
M. Mézard, and G. Parisi, “On the solution of random link matching problem,” J. Physique, vol. 48, pp. 1451–1459, 1987.
B. Olin, Asymptotic Properties of Random Assignment Problems, Dept. of Mathematics, Stockholm, 1992.
K.G. Ramakrishnan, N.K. Karmarkar, and A.P. Kamath, “An approximate dual projective algorithm for solving assignment problems,” in Proc. of the DIMACS Conf., New Brunswick, NJ, 1991.
L. Schrage, “A more portable Fortran random number generator,” ACM TOMS, 1979.
L. Slominski, “Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations,” Comput., vol. 28, pp. 257–267, 1982.
J.M. Steele, “Probability and statistics in the service of computer science: Illustrations using the assignment problem,” Commun. Statist. Theory Meth., vol. 19(11), pp. 4315–4329, 1990.
D.W. Walkup, “On the expected value of a random assignment problem,” SIAM J. Scient. Stat. Computing, vol. 8, pp. 440–442, 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pardalos, P.M., Ramakrishnan, K.G. On the expected optimal value of random assignment problems: Experimental results and open questions. Comput Optim Applic 2, 261–271 (1993). https://doi.org/10.1007/BF01299451
Issue Date:
DOI: https://doi.org/10.1007/BF01299451