{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:28:42Z","timestamp":1743146922594,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":32,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_20","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:08:07Z","timestamp":1219662487000},"page":"114-123","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotic Properties of Random Multidimensional Assignment Problem"],"prefix":"10.1007","author":[{"given":"Pavlo A.","family":"Krokhmal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"20_CR1_20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"RM Aiex","year":"2005","unstructured":"Aiex RM, Resende MGC, Pardalos PM, Toraldo G (2005) GRASP with Path Relinking for Three-Index Assignment. INFORMS J Comput 17(2):224\u2013247","journal-title":"INFORMS J Comput"},{"issue":"4","key":"20_CR2_20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1002\/rsa.1015","volume":"18","author":"D Aldous","year":"2001","unstructured":"Aldous D (2001) The $$ { \\zeta(2) } $$ limit in the random assignment problem. Random Struct Algorithm 18(4):381\u2013418","journal-title":"Random Struct Algorithm"},{"key":"20_CR3_20","volume-title":"The Probabilistic Method, 2nd edn, Interscience Series in Discrete Mathematics and Optimization","author":"N Alon","year":"2000","unstructured":"Alon N, Spencer J (2000) The Probabilistic Method, 2nd edn, Interscience Series in Discrete Mathematics and Optimization. Wiley, New York"},{"key":"20_CR4_20","doi-asserted-by":"crossref","unstructured":"Andrijich SM, Caccetta L (2001) Solving the multisensor data association problem. Nonlinear Analysis 47:5525\u20135536","DOI":"10.1016\/S0362-546X(01)00656-3"},{"key":"20_CR5_20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0304-3975(00)00239-5","volume":"263","author":"E Angel","year":"2001","unstructured":"Angel E, Zissimopoulos V (2001) On the landscape ruggedness of the quadratic assignment problem. Theor Comput Sci 263:159\u2013172","journal-title":"Theor Comput Sci"},{"key":"20_CR6_20","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E Balas","year":"1991","unstructured":"Balas E, Saltzman MJ (1991) An algorithm for the three-index assignment problem. Oper Res 39:150\u2013161","journal-title":"Oper Res"},{"key":"20_CR7_20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0166-218X(01)00343-2","volume":"123","author":"RE Burkard","year":"2002","unstructured":"Burkard RE (2002) Selected topics on assignment problems. Discret Appl Math 123:257\u2013302","journal-title":"Discret Appl Math"},{"key":"20_CR8_20","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: A\u00a0Guide to the Theory of NP-completeness. Freeman, San Francisco"},{"key":"20_CR9_20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/moor.18.2.267","volume":"18","author":"MX Goemans","year":"1993","unstructured":"Goemans MX, Kodialam M (1993) A\u00a0lower bound on the expected value of an optimal assignment. Math Oper Res 18:267\u2013274","journal-title":"Math Oper Res"},{"issue":"3","key":"20_CR10_20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1023\/B:JOTA.0000042592.16418.1b","volume":"122","author":"DA Grundel","year":"2004","unstructured":"Grundel DA, Oliveira CAS, Pardalos PM (2004) Asymptotic properties of random multidimensional assignment problems. J\u00a0Optim Theory Appl 122(3):487\u2013500","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"20_CR11_20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-006-9009-5","volume":"13","author":"DA Grundel","year":"2007","unstructured":"Grundel DA, Krokhmal PA, Oliveira CAS, Pardalos PM (2007) Asymptotic properties of random multidimensional assignment problems. J\u00a0Comb Optim 13(1):1\u201318","journal-title":"J Comb Optim"},{"key":"20_CR12_20","first-page":"1","volume-title":"Discret Algorithm Complexity","author":"RM Karp","year":"1987","unstructured":"Karp RM (1987) An upper bound on the expected cost of an optimal assignment. In: Discret Algorithm Complexity. Academic Press, Boston, pp\u00a01\u20134"},{"key":"20_CR13_20","doi-asserted-by":"crossref","unstructured":"Krokhmal PA, Grundel DA, Pardalos P (2007) Asymptotic Behavior of the Expected Optimal Value of the Multidimensional Assignment Problem. Math Program 109(2\u20133):525\u2013551","DOI":"10.1007\/s10107-006-0036-x"},{"key":"20_CR14_20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6377(93)90071-N","volume":"14","author":"AJ Lazarus","year":"1993","unstructured":"Lazarus AJ (1993) Certain expected values in the random assignment problem. Oper Res Lett 14:207\u2013214","journal-title":"Oper Res Lett"},{"key":"20_CR15_20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"issue":"3","key":"20_CR16_20","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s00440-003-0308-9","volume":"128","author":"S Linusson","year":"2004","unstructured":"Linusson S, W\u00e4stlund J (2004) A\u00a0proof of Parisi's conjecture on the random assignment problem. Probab Theory Relat Fields 128(3):419\u2013440","journal-title":"Probab Theory Relat Fields"},{"issue":"17","key":"20_CR17_20","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1051\/jphyslet:019850046017077100","volume":"46","author":"M M\u00e9zard","year":"1985","unstructured":"M\u00e9zard M, Parisi G (1985) Replicas and optimization. J\u00a0Phys Lett 46(17):771\u2013778","journal-title":"J Phys Lett"},{"key":"20_CR18_20","doi-asserted-by":"crossref","unstructured":"Murphey R, Pardalos P, Pitsoulis L (1998) A\u00a0greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: DIMACS Series, vol\u00a040, American Mathematical Society, pp\u00a0277\u2013302","DOI":"10.1090\/dimacs\/040\/17"},{"issue":"4","key":"20_CR19_20","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/rsa.20084","volume":"27","author":"C Nair","year":"2005","unstructured":"Nair C, Prabhakar B, Sharma M (2005) A\u00a0Proof of the Conjecture due to Parisi for the Finite Random Assignment Problem. Random Struct Algorithms 27(4):413\u2013444","journal-title":"Random Struct Algorithms"},{"key":"20_CR20_20","unstructured":"Olin B (1992) Asymptotic properties of the random assignment problem. Ph.D thesis, Royal Institute of Technology, Stockholm, Sweden"},{"key":"20_CR21_20","first-page":"3","volume-title":"Molecular Evolution on Rugged Ladscapes: Proteins, RNA, and the Immune System","author":"R Palmer","year":"1991","unstructured":"Palmer R (1991) Optimization on rugged landscapes. In: Perelson A, Kauffman S (eds) Molecular Evolution on Rugged Ladscapes: Proteins, RNA, and the Immune System. Addison Wesley, Redwood City, pp\u00a03\u201325"},{"key":"20_CR22_20","doi-asserted-by":"crossref","unstructured":"Pardalos PM, Ramakrishnan KG (1993) On the expected optimal value of random assignment problems: Experimental results and open questions. Comput Optim Appl 2:261\u2013271","DOI":"10.1007\/BF01299451"},{"key":"20_CR23_20","unstructured":"Parisi G (1998) A\u00a0conjecture on random bipartite matching. Physics e-Print archive, http:\/\/xxx.lang.gov\/ps\/cond-_mat\/9801176"},{"key":"20_CR24_20","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitrou","year":"1998","unstructured":"Papadimitrou CH, Steiglitz K (1998) Combinatorial Optimization: Algorithms and Complexity. Dover, New York"},{"key":"20_CR25_20","unstructured":"Pasiliao EL (2003) Algorithms for Multidimensional Assignment Problems. PhD thesis, University of Florida"},{"key":"20_CR26_20","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W Pierskalla","year":"1968","unstructured":"Pierskalla W (1968) The multidimensional assignment problem. Oper Res 16:422\u2013431","journal-title":"Oper Res"},{"key":"20_CR27_20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01299390","volume":"3","author":"AB Poore","year":"1994","unstructured":"Poore AB (1994) Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Comput Optim Appl 3:27\u201354","journal-title":"Comput Optim Appl"},{"key":"20_CR28_20","first-page":"422","volume":"16","author":"J Pusztaszeri","year":"1995","unstructured":"Pusztaszeri J, Rensing PE, Liebling TM (1995) Tracking elementary particles near their primary vertex: a\u00a0combinatorial approach. J\u00a0Glob Optim 16:422\u2013431","journal-title":"J Glob Optim"},{"key":"20_CR29_20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"R Stanley","year":"1986","unstructured":"Stanley R (1986) Enumerative Combinatorics. Wadsworth and Brooks, Belmont CA"},{"key":"20_CR30_20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9655-0","volume-title":"The Multivariate Normal Distribution","author":"YL Tong","year":"1990","unstructured":"Tong YL (1990) The Multivariate Normal Distribution. Springer, Berlin"},{"key":"20_CR31_20","doi-asserted-by":"crossref","unstructured":"Veenman CJ, Hendriks EA, Reinders MJT (1998) A\u00a0fast and robust point tracking algorithm. Proc Fifth IEEE Int Conf Image Processing 653\u2013657, Chicago, USA","DOI":"10.1109\/ICIP.1998.999051"},{"key":"20_CR32_20","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","volume":"8","author":"DW Walkup","year":"1979","unstructured":"Walkup DW (1979) On the expected value of a\u00a0random assignment problem. SIAM J Comput 8:440\u2013442","journal-title":"SIAM J Comput"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:25:42Z","timestamp":1738344342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_20","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}