{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:19Z","timestamp":1725535819865},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_10","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T10:12:39Z","timestamp":1248689559000},"page":"100-115","source":"Crossref","is-referenced-by-count":8,"title":["Local Search Heuristics for the Multidimensional Assignment Problem"],"prefix":"10.1007","author":[{"given":"G.","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Karapetyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R.M. Aiex","year":"2005","unstructured":"Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: Grasp with path relinking for three-index assignment. INFORMS J. on Computing\u00a017(2), 224\u2013247 (2005)","journal-title":"INFORMS J. on Computing"},{"key":"10_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. John Wiley, Chichester (2000)","edition":"2"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","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.\u00a039(1), 150\u2013161 (1991)","journal-title":"Oper. Res."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11424925_43","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"H. Bekker","year":"2005","unstructured":"Bekker, H., Braad, E.P., Goldengorin, B.: Using bipartite and multidimensional matching to select the roots of a system of polynomial equations. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03483, pp. 397\u2013406. Springer, Heidelberg (2005)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., \u00c7ela, E.: Linear assignment problems and extensions. In: Du, Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, Dordrecht, pp. 75\u2013149 (1999)","DOI":"10.1007\/978-1-4757-3023-4_2"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a060(3), 273\u2013279 (1992)","journal-title":"European Journal of Operational Research"},{"key":"10_CR7","series-title":"Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman, New York (1979)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/B:JOTA.0000042592.16418.1b","volume":"122","author":"D. Grundel","year":"2004","unstructured":"Grundel, D., Oliveira, C., Pardalos, P.: Asymptotic properties of random multidimensional assignment problems. Journal of Optimization Theory and Applications\u00a0122(3), 33\u201346 (2004)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10589-005-4558-6","volume":"30","author":"D.A. Grundel","year":"2005","unstructured":"Grundel, D.A., Pardalos, P.M.: Test problem generator for the multidimensional assignment problem. Comput. Optim. Appl.\u00a030(2), 133\u2013146 (2005)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ejor.2004.09.042","volume":"127","author":"G. Huang","year":"2006","unstructured":"Huang, G., Lim, A.: A hybrid genetic algorithm for the three-index assignment problem. European Journal of Operational Research\u00a0127(1), 249\u2013257 (2006)","journal-title":"European Journal of Operational Research"},{"key":"10_CR11","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: Seminumerical Algorithms, 2nd edn. The Art of Computer Programming, vol.\u00a02. Addison-Wesley, Reading (1981)","edition":"2"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistic Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistic Quarterly"},{"key":"10_CR13","unstructured":"Microsoft. MSDN, chapter Random Class. Microsoft (2008), http:\/\/msdn2.microsoft.com\/en-us\/library\/system.random.aspx"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W.P. Pierskalla","year":"1968","unstructured":"Pierskalla, W.P.: The multidimensional assignment problem. Operations Research\u00a016, 422\u2013431 (1968)","journal-title":"Operations Research"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011285402433","volume":"19","author":"A.J. Robertson","year":"2001","unstructured":"Robertson, A.J.: A set of greedy randomized adaptive local search procedure (grasp) implementations for the multidimensional assignment problem. Comput. Optim. Appl.\u00a019(2), 145\u2013164 (2001)","journal-title":"Comput. Optim. Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T14:18:35Z","timestamp":1558448315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}