{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:45:17Z","timestamp":1753440317571,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10898-020-00988-8","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T02:02:31Z","timestamp":1610935351000},"page":"691-716","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A dual approach to multi-dimensional assignment problems"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1215-3672","authenticated-orcid":false,"given":"Jingqun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thia","family":"Kirubarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Tharmarasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daly","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishna R.","family":"Pattipati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"key":"988_CR1","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1109\/TITS.2011.2160856","volume":"12","author":"F Abdallah","year":"2011","unstructured":"Abdallah, F., Nassreddine, G., Den\u0153ux, T.: A multiple-hypothesis map-matching method suitable for weighted and box-shaped state estimation for localization. IEEE Trans. Intell. Transp. Syst. 12, 1495\u20131510 (2011)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"988_CR2","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/opre.33.3.527","volume":"33","author":"ML Balinski","year":"1985","unstructured":"Balinski, M.L.: Signature methods for the assignment problem. Oper. Res. 33, 527\u2013536 (1985)","journal-title":"Oper. Res."},{"key":"988_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(94)90199-6","volume":"49","author":"HJ Bandelt","year":"1994","unstructured":"Bandelt, H.J., Crama, Y., Spieksma, F.C.: Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discret. Appl. Math. 49, 25\u201350 (1994)","journal-title":"Discret. Appl. Math."},{"key":"988_CR4","volume-title":"Tracking and Data Fusion: A Handbook of Algorithms","author":"Y Bar-Shalom","year":"2011","unstructured":"Bar-Shalom, Y., Willett, P.K., Tian, X.: Tracking and Data Fusion: A Handbook of Algorithms. YBS Publishing, Storrs (2011)"},{"key":"988_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF00249638","volume":"1","author":"DP Bertsekas","year":"1992","unstructured":"Bertsekas, D.P., Castanon, D.A.: A forward\/reverse auction algorithm for asymmetric assignment problems. Comput. Optim. Appl. 1, 277\u2013279 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"988_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/MAES.2004.1263228","volume":"19","author":"SS Blackman","year":"2004","unstructured":"Blackman, S.S.: Multiple hypothesis tracking for multiple target tracking. IEEE Aerosp. Electron. Syst. Mag. 19, 5\u201318 (2004)","journal-title":"IEEE Aerosp. Electron. Syst. Mag."},{"key":"988_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0166-218X(01)00343-2","volume":"123","author":"RE Burkard","year":"2002","unstructured":"Burkard, R.E.: Selected topics on assignment problems. Discret. Appl. Math. 123, 257\u2013302 (2002)","journal-title":"Discret. Appl. Math."},{"key":"988_CR8","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/7.575891","volume":"33","author":"S Deb","year":"1997","unstructured":"Deb, S., Yeddanapudi, M., Pattipati, K.R., Bar-Shalom, Y.: Generalized S-D assignment algorithm for multisensor-multitarget state estimation. IEEE Trans. Aerosp. Electron. Syst. 33, 523\u2013538 (1997)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"988_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M Dell\u2019Amico","year":"2000","unstructured":"Dell\u2019Amico, M., Toth, P.: Algorithms and codes for dense assignment problems: the state of the art. Discret. Appl. Math. 100, 17\u201348 (2000)","journal-title":"Discret. Appl. Math."},{"key":"988_CR10","unstructured":"Emami, P., Pardalos, P.M., Elefteriadou, L., Ranka, S.: Machine learning methods for solving assignment problems in multi-target tracking. arXiv preprint arXiv:1802.06897 (2018)"},{"key":"988_CR11","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1057\/jors.1981.207","volume":"32","author":"AM 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":"988_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"988_CR13","doi-asserted-by":"crossref","unstructured":"Garg, V., Wickramarathne, T.: MHT approach to ubiquitous monitoring of spatio-temporal phenomena. In: 21st International Conference on Information Fusion, Cambridge, UK, pp. 1816\u20131821 (2018)","DOI":"10.23919\/ICIF.2018.8455645"},{"key":"988_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10589-005-4558-6","volume":"30","author":"DA Grundel","year":"2005","unstructured":"Grundel, D.A., Pardalos, P.M.: Test problem generator for the multidimensional assignment problem. Comput. Optim. Appl. 30, 133\u2013146 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"988_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 325\u2013340 (1987)","journal-title":"Computing"},{"key":"988_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-010-9133-3","volume":"17","author":"D Karapetyan","year":"2011","unstructured":"Karapetyan, D., Gutin, G.: Local search heuristics for the multidimensional assignment problem. J. Heuristics 17, 201\u2013249 (2011)","journal-title":"J. Heuristics"},{"key":"988_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/7.826310","volume":"36","author":"T Kirubarajan","year":"2000","unstructured":"Kirubarajan, T., Bar-Shalom, Y., Pattipati, K.R., Kadar, I.: Ground target tracking with variable structure IMM estimator. IEEE Trans. Aerosp. Electron. Syst. 36, 26\u201346 (2000)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"988_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/7.913664","volume":"37","author":"T Kirubarajan","year":"2001","unstructured":"Kirubarajan, T., Bar-Shalom, Y., Pattipati, K.R.: Multiassignment for tracking a large number of overlapping objects. IEEE Trans. Aerosp. Electron. Syst. 37, 2\u201321 (2001)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"988_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Log. Quart. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Log. Quart."},{"key":"988_CR20","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14, 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"988_CR21","doi-asserted-by":"crossref","unstructured":"Lau, R.A., Williams, J.L.: Multidimensional assignment by dual decomposition. In: Seventh International Conference on Intelligent Sensors, Sensor Networks and Information Processing, Adelaide, Australia, pp. 437\u2013442 (2011)","DOI":"10.1109\/ISSNIP.2011.6146551"},{"key":"988_CR22","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10589-019-00113-w","volume":"74","author":"J Li","year":"2019","unstructured":"Li, J., Tharmarasa, R., Brown, D., et al.: A novel convex dual approach to three-dimensional assignment problem: theoretical analysis. Comput. Optim. Appl. 74, 481\u2013516 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00113-w","journal-title":"Comput. Optim. Appl."},{"key":"988_CR23","unstructured":"Li, J.: Efficient data association algorithms for multi-target tracking. PhD thesis, McMaster University. Sep., 2019. On line access: http:\/\/hdl.handle.net\/11375\/25001 (2019)"},{"key":"988_CR24","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/9.121621","volume":"37","author":"KR Pattipati","year":"1992","unstructured":"Pattipati, K.R., Deb, S., Bar-Shalom, Y., Washburn, R.B.: A new relaxation algorithm and passive sensor data association. IEEE Trans. Autom. Control 37, 198\u2013212 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"key":"988_CR25","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico, D.W.: Assignment problems: a golden anniversary survey. Eur. J. Oper. Res. 176, 774\u2013793 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"988_CR26","unstructured":"Plitsos, S., Magos, D., Mourtos, I.: An integrated solver for multi-index assignment. In: International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, FL (2016)"},{"key":"988_CR27","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/0803027","volume":"3","author":"AB Poore","year":"1993","unstructured":"Poore, A.B., Rijavec, N.: A Lagrangian relaxation algorithm for multidimensional assignment problems arsing from multitarget tracking. SIAM J. Optim. 3, 544\u2013563 (1993)","journal-title":"SIAM J. Optim."},{"key":"988_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008669120497","volume":"8","author":"AB Poore","year":"1997","unstructured":"Poore, A.B., Robertson III, A.J.: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems. Comput. Optim. Appl. 8, 129\u2013150 (1997)","journal-title":"Comput. Optim. Appl."},{"key":"988_CR29","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1016\/j.mcm.2005.05.026","volume":"43","author":"AB Poore","year":"2006","unstructured":"Poore, A.B., Gadaleta, S.: Some assignment problems arising from multiple target tracking. Math. Comput. Modell. 43, 1074\u20131091 (2006)","journal-title":"Math. Comput. Modell."},{"key":"988_CR30","first-page":"2000","volume-title":"Multitarget-Multisensor Tracking: Applications and Advances","author":"K Pattipati","year":"2000","unstructured":"Pattipati, K., Popp, R., Kirubarajan, T.: Survey of assignment techniques for multitarget tracking. In: Bar-Shalom, Y., Blair, W.D. (eds.) Multitarget-Multisensor Tracking: Applications and Advances, vol. III, p. 2000. Artech House, Dedham (2000)"},{"key":"988_CR31","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011285402433","volume":"19","author":"AJ 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, 145\u2013164 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"988_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, Berlin (1985)"},{"key":"988_CR33","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10589-013-9619-7","volume":"58","author":"C Vogiatzis","year":"2014","unstructured":"Vogiatzis, C., Pasiliao, E.L., Pardalos, P.M.: Graph partitions for the multidimensional assignment problem. Comput. Optim. Appl. 58, 205\u2013224 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"988_CR34","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.ejor.2013.10.048","volume":"235","author":"JL Walteros","year":"2014","unstructured":"Walteros, J.L., Vogiatzis, C., Pasiliao, E.L., Pardalos, P.M.: Integer programming models for the multidimensional assignment problem with star costs. Eur. J. Oper. Res. 235, 553\u2013568 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"988_CR35","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/7.745696","volume":"35","author":"H Wang","year":"1999","unstructured":"Wang, H., Kirubarajan, T., Bar-Shalom, Y.: Large scale air traffic surveillance using IMM estimators with assignment. IEEE Trans. Aerosp. Electron. Syst. 35, 255\u2013266 (1999)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00988-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00988-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00988-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,18]],"date-time":"2021-10-18T04:32:12Z","timestamp":1634531532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00988-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["988"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00988-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,1,18]]},"assertion":[{"value":"12 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}