{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:17:42Z","timestamp":1768522662282,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T00:00:00Z","timestamp":1271808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10732-010-9133-3","type":"journal-article","created":{"date-parts":[[2010,4,20]],"date-time":"2010-04-20T17:18:56Z","timestamp":1271783936000},"page":"201-249","source":"Crossref","is-referenced-by-count":20,"title":["Local search heuristics for the multidimensional assignment problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Daniel","family":"Karapetyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,21]]},"reference":[{"issue":"2","key":"9133_CR1","doi-asserted-by":"crossref","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. Comput. 17(2), 224\u2013247 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9133_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"issue":"8","key":"9133_CR3","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":"1","key":"9133_CR4","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":"7","key":"9133_CR5","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1057\/palgrave.jors.2601723","volume":"55","author":"H.J. Bandelt","year":"2004","unstructured":"Bandelt, H.J., Maas, A., Spieksma, F.C.R.: Local search heuristics for multi-index assignment problems with decomposable costs. J. Oper. Res. Soc. 55(7), 694\u2013704 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"9133_CR6","series-title":"Lecture Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/11424925_43","volume-title":"Computational Science and Its Applications\u2014ICCSA 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: Computational Science and Its Applications\u2014ICCSA 2005. Lecture Notes Comp. Sci., vol. 3483, pp. 397\u2013406. Springer, Berlin (2005)"},{"key":"9133_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4757-3023-4_2","volume-title":"Handbook of Combinatorial Optimization","author":"R.E. Burkard","year":"1999","unstructured":"Burkard, R.E., \u00c7ela, E.: Linear assignment problems and extensions. In: Du, Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 75\u2013149. Kluwer Academic, Dordrecht (1999)"},{"issue":"2","key":"9133_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R.E. Burkard","year":"1996","unstructured":"Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Appl. Math. 70(2), 95\u2013161 (1996a)","journal-title":"Discrete Appl. Math."},{"key":"9133_CR9","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Rudolf, R., Woeginger, G.J.: Three-dimensional axial assignment problems with decomposable cost coefficients. Technical Report 238, Graz (1996b)","DOI":"10.1016\/0166-218X(95)00031-L"},{"key":"9133_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/9789812796592_0003","volume-title":"Theory and Algorithms for Cooperative Systems. Applying Simulated Annealing to the Multidimensional Assignment Problem","author":"W.K. Clemons","year":"2004","unstructured":"Clemons, W.K., Grundel, D.A., Jeffcoat, D.E.: In: Theory and Algorithms for Cooperative Systems. Applying Simulated Annealing to the Multidimensional Assignment Problem, pp. 45\u201361. World Scientific, Singapore (2004)"},{"issue":"3","key":"9133_CR11","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."},{"key":"9133_CR12","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1057\/jors.1981.207","volume":"32","author":"A.M. Frieze","year":"1981","unstructured":"Frieze, A.M., Yadegar, J.: An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice. J. Oper. Res. Soc. 32, 989\u2013995 (1981)","journal-title":"J. Oper. Res. Soc."},{"key":"9133_CR13","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. Freeman, New York (1979)"},{"issue":"2","key":"9133_CR14","doi-asserted-by":"crossref","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. 30(2), 133\u2013146 (2005)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"9133_CR15","doi-asserted-by":"crossref","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. J. Optim. Theory Appl. 122(3), 33\u201346 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"9133_CR16","doi-asserted-by":"crossref","unstructured":"Gutin, G., Karapetyan, D.: Greedy like algorithms for the traveling salesman problem and multidimensional assignment problem. In: Advances in Greedy Algorithms. I-Tech (2008)","DOI":"10.5772\/5885"},{"issue":"1","key":"9133_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s12293-008-0001-8","volume":"1","author":"G. Gutin","year":"2009","unstructured":"Gutin, G., Karapetyan, D.: A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Comput. 1(1), 25\u201334 (2009)","journal-title":"Memetic Comput."},{"issue":"2","key":"9133_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10732-007-9033-3","volume":"14","author":"G. Gutin","year":"2008","unstructured":"Gutin, G., Goldengorin, B., Huang, J.: Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems. J. Heuristics 14(2), 169\u2013181 (2008)","journal-title":"J. Heuristics"},{"key":"9133_CR19","doi-asserted-by":"crossref","unstructured":"Harris, J.M., Hirst, J.L., Mossinghoff, M.J.: Combinatorics and Graph Theory. Mathematics (2008)","DOI":"10.1007\/978-0-387-79711-3"},{"issue":"1","key":"9133_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.ejor.2004.09.042","volume":"172","author":"G. Huang","year":"2006","unstructured":"Huang, G., Lim, A.: A hybrid genetic algorithm for the three-index assignment problem. Eur. J. Oper. Res. 172(1), 249\u2013257 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"9133_CR21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.cviu.2004.10.008","volume":"100","author":"V. Isler","year":"2005","unstructured":"Isler, V., Khanna, S., Spletzer, J., Taylor, C.J.: Target tracking with distributed sensors: The focus of attention problem. Comput. Vis. Image Underst. J. 100(1\u20132), 225\u2013247 (2005). Special Issue on Attention and Performance in Computer Vision","journal-title":"Comput. Vis. Image Underst. J."},{"key":"9133_CR22","unstructured":"Karapetyan, D.: http:\/\/www.cs.rhul.ac.uk\/Research\/ToC\/publications\/Karapetyan\/ (2009)"},{"key":"9133_CR23","series-title":"Texts in Algorithmics","first-page":"107","volume-title":"London Algorithmics 2008: Theory and Practice","author":"D. Karapetyan","year":"2009","unstructured":"Karapetyan, D., Gutin, G., Goldengorin, B.: Empirical evaluation of construction heuristics for the multidimensional assignment problem. In: Chan, J., Daykin, J.W., Rahman, M.S. (eds.) London Algorithmics 2008: Theory and Practice. Texts in Algorithmics, pp. 107\u2013122. College Sci. Publ., State College (2009)"},{"issue":"2\u20133","key":"9133_CR24","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":"9133_CR25","doi-asserted-by":"crossref","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. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"issue":"9","key":"9133_CR26","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1016\/j.dam.2007.10.013","volume":"157","author":"Y. Kuroki","year":"2007","unstructured":"Kuroki, Y., Matsui, T.: An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discrete Appl. Math. 157(9), 2124\u20132135 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9133_CR27","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1090\/dimacs\/040\/17","volume":"40","author":"R. Murphey","year":"1998","unstructured":"Murphey, R., Pardalos, P., Pitsoulis, L.: A GRASP for the multitarget multisensor tracking problem. Networks Discrete Math. Theor. Comput. Sci. Ser. 40, 277\u2013302 (1998)","journal-title":"Networks Discrete Math. Theor. Comput. Sci. Ser."},{"key":"9133_CR28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.apnum.2003.11.014","volume":"49","author":"C.A.S. Oliveira","year":"2004","unstructured":"Oliveira, C.A.S., Pardalos, P.M.: Randomized parallel algorithms for the multidimensional assignment problem. Appl. Numer. Math. 49, 117\u2013133 (2004)","journal-title":"Appl. Numer. Math."},{"key":"9133_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3155-2","volume-title":"Nonlinear Assignment Problems","author":"P.M. Pardalos","year":"2000","unstructured":"Pardalos, P.M., Pitsoulis, L.S.: Nonlinear Assignment Problems. Springer, Berlin (2000)"},{"key":"9133_CR30","series-title":"Nonlinear Optimization and Applications","first-page":"235","volume-title":"Quadratic and Multidimensional Assignment Problems","author":"P.M. Pardalos","year":"2000","unstructured":"Pardalos, P.M., Pitsoulis, L.S.: In: Quadratic and Multidimensional Assignment Problems. Nonlinear Optimization and Applications, vol.\u00a02, pp. 235\u2013276. Kluwer Academic, Dordrecht (2000)"},{"issue":"1","key":"9133_CR31","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/10556780410001697695","volume":"20","author":"E.L. Pasiliao","year":"2005","unstructured":"Pasiliao, E.L., Pardalos, P.M., Pitsoulis, L.S.: Branch and bound algorithms for the multidimensional assignment problem. Optim. Methods Softw. 20(1), 127\u2013143 (2005)","journal-title":"Optim. Methods Softw."},{"key":"9133_CR32","doi-asserted-by":"crossref","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. Oper. Res. 16, 422\u2013431 (1968)","journal-title":"Oper. Res."},{"key":"9133_CR33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00121750","volume":"9","author":"J. Pusztaszeri","year":"1996","unstructured":"Pusztaszeri, J., Rensing, P., Liebling, Th.M.: Tracking elementary particles near their primary vertex: a\u00a0combinatorial approach. J. Glob. Optim. 9, 41\u201364 (1996)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9133_CR34","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1011319115230","volume":"7","author":"R.L. Rardin","year":"2001","unstructured":"Rardin, R.L., Uzsoy, R.: Experimental evaluation of heuristic optimization algorithms: A tutorial. J.\u00a0Heuristics 7(3), 261\u2013304 (2001)","journal-title":"J.\u00a0Heuristics"},{"issue":"2","key":"9133_CR35","doi-asserted-by":"crossref","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. 19(2), 145\u2013164 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"9133_CR36","series-title":"Nonlinear Assignment Problems, Algorithms and Application","first-page":"1","volume-title":"Multi Index Assignment Problems: Complexity, Approximation, Applications","author":"F.C.R. Spieksma","year":"2000","unstructured":"Spieksma, F.C.R.: In: Multi Index Assignment Problems: Complexity, Approximation, Applications. Nonlinear Assignment Problems, Algorithms and Application, pp. 1\u201312. Kluwer Academic, Norwell (2000)"},{"key":"9133_CR37","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"F. Spieksma","year":"1996","unstructured":"Spieksma, F., Woeginger, G.: Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91, 611\u2013618 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9133_CR38","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E.-G. Talbi","year":"2009","unstructured":"Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, New York (2009)"},{"issue":"1\u20132","key":"9133_CR39","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0004-3702(02)00380-6","volume":"145","author":"C.J. Veenman","year":"2003","unstructured":"Veenman, C.J., Reinders, M.J.T., Backer, E.: Establishing motion correspondence using extended temporal scope. Artif. Intell. 145(1\u20132), 227\u2013243 (2003)","journal-title":"Artif. Intell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9133-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9133-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9133-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T21:24:13Z","timestamp":1685568253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9133-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,21]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9133"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9133-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,21]]}}}