{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:46:49Z","timestamp":1761709609923,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10589-019-00113-w","type":"journal-article","created":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T08:05:26Z","timestamp":1559030726000},"page":"481-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A novel convex dual approach to three-dimensional assignment problem: theoretical analysis"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1215-3672","authenticated-orcid":false,"given":"Jingqun","family":"Li","sequence":"first","affiliation":[]},{"given":"R.","family":"Tharmarasa","sequence":"additional","affiliation":[]},{"given":"Daly","family":"Brown","sequence":"additional","affiliation":[]},{"given":"Thia","family":"Kirubarajan","sequence":"additional","affiliation":[]},{"given":"Krishna R.","family":"Pattipati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,28]]},"reference":[{"key":"113_CR1","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1109\/26.41158","volume":"37","author":"T Mizuike","year":"1989","unstructured":"Mizuike, T., Ito, Y.: Optimization of frequency assignment. IEEE Trans. Commun. 37, 1031\u20131041 (1989)","journal-title":"IEEE Trans. Commun."},{"key":"113_CR2","volume-title":"Multitarget-Multisensor Tracking: Principles and Techniques","author":"Y Bar-Shalom","year":"1995","unstructured":"Bar-Shalom, Y., Li, X.R.: Multitarget-Multisensor Tracking: Principles and Techniques. YBS Publishing, Storrs (1995)"},{"key":"113_CR3","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."},{"key":"113_CR4","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":"113_CR5","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":"113_CR6","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":"113_CR7","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":"113_CR8","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. Naval Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"113_CR9","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":"113_CR10","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":"113_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M Dell\u2019Amicoa","year":"2000","unstructured":"Dell\u2019Amicoa, M., Tothb, P.: Algorithms and codes for dense assignment problems: the state of the art. Discrete Appl. Math. 100, 17\u201348 (2000)","journal-title":"Discrete Appl. Math."},{"key":"113_CR12","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. Discrete Appl. Math. 123, 257\u2013302 (2002)","journal-title":"Discrete Appl. Math."},{"key":"113_CR13","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. Model. 43, 1074\u20131091 (2006)","journal-title":"Math. Comput. Model."},{"key":"113_CR14","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":"113_CR15","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. Discrete Appl. Math. 49, 25\u201350 (1994)","journal-title":"Discrete Appl. Math."},{"key":"113_CR16","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":"113_CR17","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":"113_CR18","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":"113_CR19","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":"113_CR20","unstructured":"Plitsos, S., Magos, D., Mourtos, I.: An integrated solver for multi-index assignment. In: International Symposium on Artificial Intelligence and Mathematics (2016)"},{"key":"113_CR21","unstructured":"Emami, P., Pardalos, P.M., Elefteriadou, L., Ranka, S.: Machine learning methods for solving assignment problems in multi-target tracking (2018). arXiv preprint \n                    arXiv:1802.06897"},{"key":"113_CR22","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":"113_CR23","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":"113_CR24","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":"113_CR25","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.: A 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":"113_CR26","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":"113_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1019252306512","volume":"98","author":"D Li","year":"2000","unstructured":"Li, D.: pth power Lagrangian method for integer programming. Ann. Oper. Res. 98, 151\u2013170 (2000)","journal-title":"Ann. Oper. Res."},{"key":"113_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7, 1\u20133l (1995)","journal-title":"J. Glob. Optim."},{"key":"113_CR29","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.na.2008.10.083","volume":"71","author":"V Jeyakumar","year":"2009","unstructured":"Jeyakumar, V., Lee, G.M., Srisatkunarajah, S.: New Kuhn\u2013Tucker sufficiency for global optimality via convexification. Nonlinear Anal. 71, 373\u2013381 (2009)","journal-title":"Nonlinear Anal."},{"key":"113_CR30","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":"113_CR31","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":"113_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":"113_CR33","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H Schramm","year":"1992","unstructured":"Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2, 121\u2013152 (1992)","journal-title":"SIAM J. Optim."},{"key":"113_CR34","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, Chichester (1987)"},{"key":"113_CR35","volume-title":"Convex Analysis and Optimization, 460\u2013503","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P.: Convex Analysis and Optimization, 460\u2013503. Athena Scientific, Belmont (2003)"},{"key":"113_CR36","first-page":"191","volume":"20","author":"L Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Sov. Math. Dokl. 20, 191\u2013194 (1979)","journal-title":"Sov. Math. Dokl."},{"key":"113_CR37","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (2003)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00113-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00113-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00113-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T23:11:39Z","timestamp":1590534699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00113-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,28]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00113-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,5,28]]},"assertion":[{"value":"15 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}