{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:05:49Z","timestamp":1774551949255,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10878-012-9554-z","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T17:36:17Z","timestamp":1349976977000},"page":"808-823","source":"Crossref","is-referenced-by-count":24,"title":["Solving the Multidimensional Assignment Problem by a Cross-Entropy method"],"prefix":"10.1007","volume":"27","author":[{"given":"Duc Manh","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Hoai An","family":"Le\u00a0Thi","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Pham\u00a0Dinh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,12]]},"reference":[{"issue":"2","key":"9554_CR1","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"},{"key":"9554_CR2","doi-asserted-by":"crossref","first-page":"5525","DOI":"10.1016\/S0362-546X(01)00656-3","volume":"47","author":"SM Andrijich","year":"2001","unstructured":"Andrijich SM, Caccetta L (2001) Solving the multisensor data association problem. Nonlinear Anal 47:5525\u20135536","journal-title":"Nonlinear Anal"},{"issue":"1","key":"9554_CR3","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(1):150\u2013161","journal-title":"Oper Res"},{"issue":"7","key":"9554_CR4","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1057\/palgrave.jors.2601723","volume":"55","author":"HJ Bandelt","year":"2004","unstructured":"Bandelt HJ, Maas A, Spieksma FCR (2004) Local search heuristics for multi-index assignment problems with decomposable costs. J Oper Res Soc 55(7):694\u2013704","journal-title":"J Oper Res Soc"},{"key":"9554_CR5","first-page":"373","volume-title":"Annotated bibliographies in combinatorial optimization","author":"RE Burkard","year":"1997","unstructured":"Burkard RE, \u00c7ela E (1997) Quadratic and three-dimensional assignment problems. In: Dell\u2019Amico M, Maffioli F, Martello S (eds) Annotated bibliographies in combinatorial optimization. Wiley, Chichester, pp 373\u2013392"},{"key":"9554_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4757-3023-4_2","volume-title":"Handbook of combinatorial optimization","author":"RE Burkard","year":"1999","unstructured":"Burkard RE, \u00c7ela E (1999) Linear assignment problems and extensions. In: Du D, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic, Dordrecht, pp 75\u2013149 (Chap 21)"},{"key":"9554_CR7","first-page":"661","volume-title":"Handbook of applied optimization","author":"E Cela","year":"2002","unstructured":"Cela E (2002) Assignment problems. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 661\u2013678 (Chap 17.9)"},{"key":"9554_CR8","volume-title":"Proceeding of the 2nd cooperative control and optimization conference","author":"W Clemons","year":"2003","unstructured":"Clemons W, Grundel D, Jeffcoat D (2003) Applying simulated annealing on the multidimensional assignment problem. In: Proceeding of the 2nd cooperative control and optimization conference"},{"issue":"5","key":"9554_CR9","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.orl.2006.11.005","volume":"35","author":"A Costa","year":"2007","unstructured":"Costa A, Dafydd O, Kroese D (2007) Convergence properties of the cross-entropy method for discrete optimization. Oper Res Lett 35(5):573\u2013580","journal-title":"Oper Res Lett"},{"key":"9554_CR10","volume-title":"Proceedings of the rare event simulation conference (RESIM 2006)","author":"F Dambreville","year":"2006","unstructured":"Dambreville F (2006) Cross-entropy method: convergence issues for extended implementation. In: Proceedings of the rare event simulation conference (RESIM 2006), Bamberg, Germany"},{"key":"9554_CR11","unstructured":"Dubin U (2002) The cross-entropy method for combinatorial optimization with applications. Master\u2019s thesis, The Technion, Israel Institute of Technology, Haifa"},{"issue":"2","key":"9554_CR12","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1111\/j.1540-5915.1988.tb00269.x","volume":"19","author":"KC Gilbert","year":"1988","unstructured":"Gilbert KC, Hofstra RB (1988) Multidimensional assignment problems. Decis Sci 19(2):306\u2013321","journal-title":"Decis Sci"},{"issue":"2","key":"9554_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10589-005-4558-6","volume":"30","author":"D Grundel","year":"2005","unstructured":"Grundel D, Pardalos PM (2005) Test problem generator for the multidimensional assignment problem. Comput Optim Appl 30(2):133\u2013146","journal-title":"Comput Optim Appl"},{"key":"9554_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-642-02029-2_10","volume-title":"Graph theory, computational intelligence and thought","author":"G Gutin","year":"2009","unstructured":"Gutin G, Karapetyan D (2009) Local search heuristics for the multidimensional assignment problem. In: Lipshteyn M, Levit VE, Mcconnell RM (eds) Graph theory, computational intelligence and thought. Lecture notes in computer science, vol 5420. Springer, Berlin, pp 100\u2013115"},{"issue":"9","key":"9554_CR15","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1016\/j.dam.2007.10.013","volume":"157","author":"Y Kuroki","year":"2009","unstructured":"Kuroki Y, Matsui T (2009) An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discrete Appl Math 157(9):2124\u20132135","journal-title":"Discrete Appl Math"},{"key":"9554_CR16","series-title":"DIMACS series","first-page":"277","volume-title":"A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem","author":"R Murphey","year":"1998","unstructured":"Murphey R, Pardalos PM, Pitsoulis L (1998) A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. DIMACS series, vol 40. Amer Math Soc, Providence, pp\u00a0277\u2013302"},{"issue":"1","key":"9554_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.apnum.2003.11.014","volume":"49","author":"CAS Oliveira","year":"2004","unstructured":"Oliveira CAS, Pardalos PM (2004) Randomized parallel algorithms for the multidimensional assignment problem. Appl Numer Math 49(1):117\u2013133","journal-title":"Appl Numer Math"},{"key":"9554_CR18","series-title":"Combinatorial optimization","volume-title":"Nonlinear assignment problems: algorithms and applications","year":"2000","unstructured":"Pardalos PM, Pitsoulit LS (eds) (2000) Nonlinear assignment problems: algorithms and applications. Combinatorial optimization, vol 7. Kluwer Academic, Dordrecht"},{"key":"9554_CR19","doi-asserted-by":"crossref","unstructured":"Pasiliao EL (2003) Algorithms for multidimensional assignment problems. PhD thesis, Department of Industrial and Systems Engineering, University of Florida","DOI":"10.1007\/978-1-4613-0219-3_21"},{"key":"9554_CR20","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/978-1-4419-5689-7_19","volume-title":"Dynamics of information systems","author":"EL Pasiliao","year":"2010","unstructured":"Pasiliao EL (2010) Local neighborhoods for the multidimensional assignment problem. In: Hirsch MJ, Pardalos PM, Murphey R (eds) Dynamics of information systems, vol 40. Springer, New York, pp\u00a0353\u2013371"},{"key":"9554_CR21","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":"9554_CR22","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"},{"issue":"3","key":"9554_CR23","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/0803027","volume":"3","author":"AB Poore","year":"1993","unstructured":"Poore AB, Rijavec N (1993) A Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking. SIAM J Optim 3(3):544\u2013563","journal-title":"SIAM J Optim"},{"issue":"2","key":"9554_CR24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1008669120497","volume":"8","author":"AB Poore","year":"1997","unstructured":"Poore AB, Robertson III AJ (1997) A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems. Comput Optim Appl 8(2):129\u2013150","journal-title":"Comput Optim Appl"},{"issue":"1","key":"9554_CR25","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00121750","volume":"9","author":"JF Pusztaszeri","year":"1996","unstructured":"Pusztaszeri JF, Rensing PE, Liebling TM (1996) Tracking elementary particles near their primary vertex: a combinatorial approach. J Glob Optim 9(1):41\u201364","journal-title":"J Glob Optim"},{"key":"9554_CR26","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-2217(96)00385-2","volume":"99","author":"RY Rubinstein","year":"1997","unstructured":"Rubinstein RY (1997) Optimization of computer simulation models with rare events. Eur J Oper Res 99:89\u2013112","journal-title":"Eur J Oper Res"},{"key":"9554_CR27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"2","author":"RY Rubinstein","year":"1999","unstructured":"Rubinstein RY (1999) The simulated entropy method for combinatorial and continuous optimization. Methodol Comput Appl Probab 2:127\u2013190","journal-title":"Methodol Comput Appl Probab"},{"key":"9554_CR28","first-page":"304","volume-title":"Stochastic optimization: algorithms and application","author":"RY Rubinstein","year":"2001","unstructured":"Rubinstein RY (2001) Combinatorial optimization, cross-entropy, ants and rare events. In: Uryasev S, Pardalos PM (eds) Stochastic optimization: algorithms and application. Kluwer Academic, Dordrecht, pp 304\u2013358"},{"issue":"1","key":"9554_CR29","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/511442.511444","volume":"12","author":"RY Rubinstein","year":"2002","unstructured":"Rubinstein RY (2002) The cross-entropy method and rare-events for maximal cut and bipartition problems. ACM Trans Model Comput Simul 12(1):27\u201353","journal-title":"ACM Trans Model Comput Simul"},{"key":"9554_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4321-0","volume-title":"The cross-entropy method: a unified approach to combinatorial optimization, Mont\u00e9 Carlo simulation, and machine learning","author":"RY Rubinstein","year":"2004","unstructured":"Rubinstein RY, Kroese D (2004) The cross-entropy method: a unified approach to combinatorial optimization, Mont\u00e9 Carlo simulation, and machine learning. Springer, Berlin"},{"key":"9554_CR31","series-title":"Combinatorial optimization","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":"FCR Spieksma","year":"2000","unstructured":"Spieksma FCR (2000) Multi index assignment problems: complexity, approximation, applications. In: Pardalos PM, Pitsoulit LS (eds) Nonlinear assignment problems: algorithms and applications. Combinatorial optimization, vol 7. Kluwer Academic, Dordrecht, pp 1\u201312 (Chap 1)"},{"issue":"7","key":"9554_CR32","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/S0305-0548(02)00057-6","volume":"30","author":"PPA Storms","year":"2003","unstructured":"Storms PPA, Spieksma FCR (2003) An LP-based algorithm for the data association problem in multitarget tracking. Comput Oper Res 30(7):1067\u20131085","journal-title":"Comput Oper Res"},{"key":"9554_CR33","first-page":"653","volume-title":"Proceedings of the fifth IEEE international conference on image processing","author":"CJ Veenman","year":"1998","unstructured":"Veenman CJ, Hendriks EA, Reinders MJT (1998) A fast and robust point tracking algorithm. In: Proceedings of the fifth IEEE international conference on image processing, Chicago, pp 653\u2013657"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9554-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9554-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9554-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T16:27:30Z","timestamp":1562257650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9554-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9554"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9554-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}