{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:55:32Z","timestamp":1771505732494,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"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":[[2005,7]]},"DOI":"10.1007\/s10589-005-3227-0","type":"journal-article","created":{"date-parts":[[2005,8,4]],"date-time":"2005-08-04T20:56:39Z","timestamp":1123188999000},"page":"275-293","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotic Results for Random Multidimensional Assignment Problems"],"prefix":"10.1007","volume":"31","author":[{"given":"Don","family":"Grundel","sequence":"first","affiliation":[]},{"given":"Carlos A. S.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Pasiliao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,1]]},"reference":[{"key":"3227_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF01192719","volume":"93","author":"D. Aldous","year":"1992","unstructured":"D. Aldous, \u201cAsymptotics in the random assignment problem,\u201d Probability Theory and Related Fields, vol. 93, pp. 507\u2013534, 1992.","journal-title":"Probability Theory and Related Fields"},{"key":"3227_CR2","doi-asserted-by":"publisher","first-page":"5525","DOI":"10.1016\/S0362-546X(01)00656-3","volume":"47","author":"S.M. Andrijich","year":"2001","unstructured":"S.M. Andrijich and L. Caccetta, \u201cSolving the multisensor data association problem,\u201d Nonlinear Analysis, vol. 47, pp. 5525\u20135536, 2001.","journal-title":"Nonlinear Analysis"},{"key":"3227_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<113::AID-RSA1>3.0.CO;2-S","volume":"15","author":"D. Coppersmith","year":"1999","unstructured":"D. Coppersmith and G. Sorkin, \u201cConstructive bounds and exact expectations for the random assignment problem,\u201d Random Structures and Algorithms, vol. 15, pp. 133\u2013144, 1999.","journal-title":"Random Structures and Algorithms"},{"key":"3227_CR4","unstructured":"D. Coppersmith and G. Sorkin, \u201cOn the expected incremental cost of a minimum assignment,\u201d Technical Report, IBM T.J. Watson Research Center, 1999."},{"key":"3227_CR5","volume-title":"Order Statistics","author":"H. David","year":"1970","unstructured":"H. David, Order Statistics, John Wiley and Sons: New York, 1970."},{"key":"3227_CR6","doi-asserted-by":"crossref","unstructured":"Don Grundel, Carlos A.S. Oliveira, and Panos M. Pardalos, \u201cAsymptotic properties of random multidimensional assignment problems,\u201d Journal of Optimization Theory and Applications, vol. 122, no. 3, 2004.","DOI":"10.1023\/B:JOTA.0000042592.16418.1b"},{"key":"3227_CR7","first-page":"221","volume-title":"Handbook of Applied Optimization","author":"Pierre Hansen","year":"2002","unstructured":"Pierre Hansen and Nenad Mladenovi\u0107, \u201cVariable neighborhood search,\u201d in Handbook of Applied Optimization, Panos M. Pardalos and Mauricio G. C. Resende, (Eds.), Oxford University Press: New York, NY, 2002, Chap. 3.6.9, pp. 221\u2013234.."},{"key":"3227_CR8","doi-asserted-by":"crossref","unstructured":"R.M. Karp, \u201cAn upper bound on the expected cost of an optimal assignment,\u201d in Discrete Algorithms and Complexity: Proceedings of the Japan-US Joint Seminar, D. Johnson et al. (Eds.), Academic Press: New York, 1987, pp. 1\u20134.","DOI":"10.1016\/B978-0-12-386870-1.50006-X"},{"issue":"1","key":"3227_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/7.913664","volume":"37","author":"T. Kirubarajan","year":"2001","unstructured":"T. Kirubarajan, Y. Bar-Shalom, and K.R. Pattipati, \u201cMultiassignment for tracking a large number of overlapping objects,\u201d IEEE Trans. Aerospace and Electronic Systems, vol. 37, no. 1, pp. 2\u201321, 2001.","journal-title":"IEEE Trans. Aerospace and Electronic Systems"},{"key":"3227_CR10","volume-title":"Simulation Modeling and Analysis","author":"A.M. Law","year":"1991","unstructured":"A.M. Law and W.D. Kelton, Simulation Modeling and Analysis, 2nd edn., McGraw-Hill, Inc.: New York, 1991.","edition":"2"},{"key":"3227_CR11","unstructured":"A.J. Lazarus, \u201cThe assignment problem with uniform (0,1) cost matrix,\u201d Master\u2019s Thesis, Dept. of Mathematics, Princeton University, 1979."},{"key":"3227_CR12","doi-asserted-by":"crossref","unstructured":"S. Linusson and J. W\u00e4stlund, \u201cA proof of Parisi\u2019s conjecture on the random assignment problem,\u201d Available at http:\/\/www.mai.liu.se\/jowas\/ , 2003.","DOI":"10.1007\/s00440-003-0308-9"},{"key":"3227_CR13","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1051\/jphyslet:019850046017077100","volume":"46","author":"M\u00e9zard","year":"1985","unstructured":"M\u00e9zard and Parisi, \u201cReplicas and optimization,\u201d J. Phys. Letters, vol. 46, pp. 771\u2013778, 1985.","journal-title":"J. Phys. Letters"},{"key":"3227_CR14","first-page":"1451","volume":"48","author":"M\u00e9zard","year":"1987","unstructured":"M\u00e9zard and Parisi, \u201cOn the solution of the random link matching problems,\u201d J. Phys. Letters, vol. 48, pp. 1451\u20131459, 1987.","journal-title":"J. Phys. Letters"},{"key":"3227_CR15","unstructured":"C. Nair, B. Prabhakar, and M. Sharma, \u201cA proof of the conjecture due to parisi for the finite random assignment problem,\u201d Available at http:\/\/www.stanford.edu\/~balaji\/rap.html , 2003."},{"key":"3227_CR16","unstructured":"B. Olin, \u201cAsymptotic properties of random assignment problems,\u201d PhD Thesis, Kungl Tekniska H\u00f6gskolan, Stockholm, Sweden, 1992."},{"key":"3227_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01299451","volume":"2","author":"P.M. Pardalos","year":"1993","unstructured":"P.M. Pardalos and K.G. Ramakrishnan, \u201cOn the expected optimal value of random assignment problems: Experimental results and open questions,\u201d Computational Optimization and Applications, vol. 2, pp. 261\u2013271, 1993.","journal-title":"Computational Optimization and Applications"},{"key":"3227_CR18","unstructured":"Eduardo L. Pasiliao, \u201cAlgorithms for multidimensional assignment problems,\u201d PhD Thesis, Department of Industrial and Systems Engineering, University of Florida, Gainesville FL, 2003."},{"key":"3227_CR19","first-page":"71","volume":"5","author":"W.P. Pierskalla","year":"1967","unstructured":"W.P. Pierskalla, \u201cThe multidimensional assignment problem,\u201d Opera J., vol. 5, pp. 71\u201381, 1967.","journal-title":"Opera J."},{"key":"3227_CR20","first-page":"552","volume-title":"Signal and Data Processing of Small Targets","author":"A.B. Poore","year":"1993","unstructured":"A.B. Poore, N. Rijavec, M. Liggins, and V. Vannicola, \u201cData association problems posed as multidimensional assignment Problems: problem formulation,\u201d in Signal and Data Processing of Small Targets, O.E. Drummond, (Ed.), SPIE: Bellingham, WA, 1993, pp. 552\u2013561."},{"issue":"1","key":"3227_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00121750","volume":"9","author":"J. Pusztaszeri","year":"1996","unstructured":"J. Pusztaszeri, P.E. Rensing, and T.M. Liebling, \u201cTracking elementary particles near their primary vertex: A combinatorial approach,\u201d Journal of Global Optimization, vol. 9, no. 1, pp. 41\u201364, 1996.","journal-title":"Journal of Global Optimization"},{"key":"3227_CR22","first-page":"14.1","volume-title":"Handbook of Algorithms and Theory of Computation","author":"W. Szpankowski","year":"1998","unstructured":"W. Szpankowski, \u201cAverage case analysis of algorithms,\u201d in Handbook of Algorithms and Theory of Computation, M. Atallah, (Ed.), CRC Press: Boca Raton, FL, 1998, pp. 14.1\u201314.38."},{"key":"3227_CR23","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"D.W. Walkup","year":"1979","unstructured":"D.W. Walkup, \u201cOn the expected value of a random assignment problem,\u201d SIAM Journal of Computing, vol. 8, pp. 440\u2013442, 1979.","journal-title":"SIAM Journal of Computing"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3227-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3227-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3227-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3227-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T01:06:39Z","timestamp":1683162399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3227-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["3227"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3227-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}