{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:49:45Z","timestamp":1759117785401},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1007\/bf01299451","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:29:16Z","timestamp":1111724956000},"page":"261-271","source":"Crossref","is-referenced-by-count":12,"title":["On the expected optimal value of random assignment problems: Experimental results and open questions"],"prefix":"10.1007","volume":"2","author":[{"given":"P. M.","family":"Pardalos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"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.","journal-title":"Math. Prog."},{"key":"CR2","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"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.","journal-title":"Trans. Am. Math. Society"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1147\/rd.134.0380","volume":"13","author":"W.E. Donath","year":"1969","unstructured":"W.E. Donath, ?Algorithm and average-value bounds for assignment problems,? IBM J. Res. Dev., vol. 13, pp. 380?386, 1969.","journal-title":"IBM J. Res. Dev."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02310105","volume":"39","author":"J.B.G. Frenk","year":"1986","unstructured":"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.","journal-title":"Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, ?A new polynomial-time algorithm for linear programming,? Combinatorica, vol. 4, pp. 373?395, 1984.","journal-title":"Combinatorica"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01582905","volume":"52","author":"N.K. Karmarkar","year":"1991","unstructured":"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.","journal-title":"Math. Prog."},{"key":"CR7","series-title":"Discrete Algorithms and Complexity","first-page":"1","volume-title":"An upper bound on the expected cost of an optimal assignment","author":"R.M. Karp","year":"1987","unstructured":"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."},{"key":"CR8","volume-title":"Random Allocations","author":"V.F. Kolchin","year":"1978","unstructured":"V.F. Kolchin, B.A. Sevastyanov, and V.P. Chistyakov, Random Allocations, Winston & Sons, Washington, 1978."},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1209\/0295-5075\/8\/3\/002","volume":"8","author":"W. Krauth","year":"1989","unstructured":"W. Krauth and M. M\u00e9zard, ?The cavity method and the traveling-salesman problem,? Europhys. Lett., vol.8(3), pp. 213?218, 1989.","journal-title":"Europhys. Lett."},{"key":"CR10","volume-title":"The Traveling Salesman Problem","author":"E.L. Lawler","year":"1985","unstructured":"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."},{"key":"CR11","volume-title":"The assignment problem with uniform (0, 1) cost matrix","author":"A.J. Lazarus","year":"1979","unstructured":"A.J. Lazarus, ?The assignment problem with uniform (0, 1) cost matrix,? A.B. thesis, Princeton Univ., Princeton, NJ, 1979."},{"key":"CR12","series-title":"Technical report","volume-title":"Certain expected values in the random assignment problem","author":"A.J. Lazarus","year":"1990","unstructured":"A.J. Lazarus ?Certain expected values in the random assignment problem,? Technical report, Math. & Computer Science Dept., Univ. of California: Riverside, CA, 1990."},{"key":"CR13","series-title":"Technical report","volume-title":"Average behavior of heuristic and optimal solutions to the maximization assignment problem","author":"R. Loulou","year":"1983","unstructured":"R. Loulou, ?Average behavior of heuristic and optimal solutions to the maximization assignment problem,? Technical report, Dept. of Management, Univ. of Montreal, Canada, 1983."},{"key":"CR14","series-title":"Technical report","volume-title":"Computational experience with a primal-dual interior point method for linear programming","author":"I.J. Lustig","year":"1989","unstructured":"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."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1051\/jphys:019870048090145100","volume":"48","author":"M. M\u00e9zard","year":"1987","unstructured":"M. M\u00e9zard, and G. Parisi, ?On the solution of random link matching problem,? J. Physique, vol. 48, pp. 1451?1459, 1987.","journal-title":"J. Physique"},{"key":"CR16","volume-title":"Asymptotic Properties of Random Assignment Problems","author":"B. Olin","year":"1992","unstructured":"B. Olin, Asymptotic Properties of Random Assignment Problems, Dept. of Mathematics, Stockholm, 1992."},{"key":"CR17","unstructured":"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."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"L. Schrage, ?A more portable Fortran random number generator,? ACM TOMS, 1979.","DOI":"10.1145\/355826.355828"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02241753","volume":"28","author":"L. Slominski","year":"1982","unstructured":"L. Slominski, ?Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations,? Comput., vol. 28, pp. 257?267, 1982.","journal-title":"Comput."},{"issue":"11","key":"CR20","doi-asserted-by":"crossref","first-page":"4315","DOI":"10.1080\/03610929008830444","volume":"19","author":"J.M. Steele","year":"1990","unstructured":"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.","journal-title":"Commun. Statist. Theory Meth."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"D.W. Walkup","year":"1979","unstructured":"D.W. Walkup, ?On the expected value of a random assignment problem,? SIAM J. Scient. Stat. Computing, vol. 8, pp. 440?442, 1979.","journal-title":"SIAM J. Scient. Stat. Computing"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299451.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299451\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:49:50Z","timestamp":1586180990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["BF01299451"],"URL":"https:\/\/doi.org\/10.1007\/bf01299451","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}