{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T10:26:18Z","timestamp":1663755978050},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T00:00:00Z","timestamp":1273104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11590-010-0198-6","type":"journal-article","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T02:25:09Z","timestamp":1273026309000},"page":"153-164","source":"Crossref","is-referenced-by-count":3,"title":["On optimality of a polynomial algorithm for random linear multidimensional assignment problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Pavlo A.","family":"Krokhmal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,6]]},"reference":[{"key":"198_CR1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitrou","year":"1998","unstructured":"Papadimitrou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)"},{"key":"198_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"R.E. Burkard","year":"2009","unstructured":"Burkard R.E., Dell\u2019Amico M., Martello S.: Assignment Problems. SIAM, Philadelphia (2009)"},{"key":"198_CR3","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C. Berge","year":"1989","unstructured":"Berge C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland, Amsterdam (1989)"},{"key":"198_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B.: Modern Graph Theory. Springer, New York (1998)"},{"issue":"2","key":"198_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W. Pierskalla","year":"1968","unstructured":"Pierskalla W.: The multidimensional assignment problem. Oper. Res. 16(2), 422\u2013431 (1968)","journal-title":"Oper. Res."},{"key":"198_CR6","first-page":"373","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"R.E. Burkard","year":"1999","unstructured":"Burkard R.E., \u00c7ela E.: Quadratic and three-dimensional assignments. In: Dell\u2019Amico, M. (eds) Annotated Bibliographies in Combinatorial Optimization, pp. 373\u2013391. Wiley, Chichester (1999)"},{"issue":"1\u20133","key":"198_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0166-218X(01)00343-2","volume":"123","author":"R.E. Burkard","year":"2002","unstructured":"Burkard R.E.: Selected topics on assignment problems. Discret. Appl. Math. 123(1\u20133), 257\u2013302 (2002)","journal-title":"Discret. Appl. Math."},{"key":"198_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"198_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3155-2_1","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","author":"F.C.R. Spieksma","year":"2000","unstructured":"Spieksma F.C.R.: Multi index assignment problems: complexity, approximation, applications. In: Pitsoulis, L., Pardalos, P.M. (eds) Nonlinear Assignment Problems: Algorithms and Applications, pp. 1\u201312. Kluwer, Dordrecht (2000)"},{"issue":"3","key":"198_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y. Crama","year":"1992","unstructured":"Crama Y., Spieksma F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60(3), 273\u2013279 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"198_CR11","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 M.J.: An algorithm for the three-index assignment problem. Oper. Res. 39(1), 150\u2013161 (1991)","journal-title":"Oper. Res."},{"issue":"1","key":"198_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01299390","volume":"3","author":"A.B. Poore","year":"1994","unstructured":"Poore A.B.: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Comput. Optim. Appl. 3(1), 27\u201354 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"198_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-1-4613-3632-7_17","volume-title":"Large Scale Optimization: State of the Art","author":"A.B. Poore","year":"1994","unstructured":"Poore A.B. et\u00a0al.: A numerical study of some data association problems arising in multitarget tracking. In: Hager, W.W. (eds) Large Scale Optimization: State of the Art, pp. 339\u2013361. Kluwer, Dordrecht (1994)"},{"issue":"2","key":"198_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1008669120497","volume":"8","author":"A.B. Poore","year":"1997","unstructured":"Poore A.B., Robertson A.J.: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems. Comput. Optim. Appl. 8(2), 129\u2013150 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"198_CR15","doi-asserted-by":"crossref","unstructured":"Murphey, R., Pardalos, P., Pitsoulis, L.: A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: Pardalos, P.M., Du, D.-Z. (eds.) Network Design: Connectivity and Facilities Location, volume 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 277\u2013302, American Mathematical Society (1998)","DOI":"10.1090\/dimacs\/040\/17"},{"key":"198_CR16","doi-asserted-by":"crossref","unstructured":"Murphey, R., Pardalos, P., Pitsoulis, L.: A parallel GRASP for the data association multidimensional assignment problem. In: Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol. 106, pp. 159\u2013180. Springer, Berlin (1998)","DOI":"10.1007\/978-1-4612-1492-2_7"},{"issue":"8","key":"198_CR17","doi-asserted-by":"crossref","first-page":"5525","DOI":"10.1016\/S0362-546X(01)00656-3","volume":"47","author":"S.M. Andrijich","year":"2001","unstructured":"Andrijich S.M., Caccetta L.: Solving the multisensor data association problem. Nonlinear Anal. 47(8), 5525\u20135536 (2001)","journal-title":"Nonlinear Anal."},{"issue":"6","key":"198_CR18","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1007\/s10559-006-0031-5","volume":"41","author":"V.M. Kravtsov","year":"2005","unstructured":"Kravtsov V.M.: Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem. Cybern. Syst. Anal. 41(6), 940\u2013944 (2005)","journal-title":"Cybern. Syst. Anal."},{"issue":"1","key":"198_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.11.062","volume":"194","author":"P. Krokhmal","year":"2009","unstructured":"Krokhmal P., Pardalos P.M.: Random assignment problems. Eur. J. Oper. Res. 194(1), 1\u201317 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"198_CR20","first-page":"73","volume":"27","author":"R.E. Burkard","year":"1982","unstructured":"Burkard R.E., Fincke U.: The asymptotic probabilistic behavior of quadratic sum assignment problems 27, 73\u201381 (1982)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"1","key":"198_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(85)90037-X","volume":"12","author":"R.E. Burkard","year":"1985","unstructured":"Burkard R.E., Fincke U.: Probabilistic asymptotic properties of some combinatorial optimization problems. Discret. Appl. Math. 12(1), 21\u201329 (1985)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"198_CR22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/02331939508844086","volume":"33","author":"W. Szpankowski","year":"1995","unstructured":"Szpankowski W.: Combinatorial optimization problems for which almost every algorithm is asymptotically optimal!. Optimization 33(4), 359\u2013367 (1995)","journal-title":"Optimization"},{"issue":"2\u20133","key":"198_CR23","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10107-006-0036-x","volume":"109","author":"P. Krokhmal","year":"2007","unstructured":"Krokhmal P., Grundel D., Pardalos P.: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Math. Program. 109(2\u20133), 525\u2013551 (2007)","journal-title":"Math. Program."},{"key":"198_CR24","unstructured":"Krokhmal, P.A., Pardalos, P.M.: Limiting optimal values and convergence rates in some combinatorial optimization problems on hypergraph matchings. In review (2009)"},{"key":"198_CR25","volume-title":"An Introduction to Probability Theory and Its Applications, vol. 1","author":"W. Feller","year":"1968","unstructured":"Feller W.: An Introduction to Probability Theory and Its Applications, vol. 1, 3rd edn. Wiley, New York (1968)","edition":"3"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0198-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0198-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0198-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:04Z","timestamp":1559560504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0198-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0198-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,6]]}}}