{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T04:58:43Z","timestamp":1776920323753,"version":"3.51.2"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:00:00Z","timestamp":1629072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T00:00:00Z","timestamp":1629072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100013395","name":"Sistema Nacional de Investigadores","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013395","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11590-021-01791-4","type":"journal-article","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T07:04:02Z","timestamp":1629097442000},"page":"1531-1548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The assignment problem revisited"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9783-8587","authenticated-orcid":false,"given":"Carlos A.","family":"Alfaro","sequence":"first","affiliation":[]},{"given":"Sergio L.","family":"Perez","sequence":"additional","affiliation":[]},{"given":"Carlos E.","family":"Valencia","sequence":"additional","affiliation":[]},{"given":"Marcos C.","family":"Vargas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"key":"1791_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"DP Bertsekas","year":"1988","unstructured":"Bertsekas, D.P.: The auction algorithm: a distributed relaxation method for the assignment problem. Annal Op. Res. 14, 105\u2013123 (1988)","journal-title":"Annal Op. Res."},{"key":"1791_CR2","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/S0167-8191(05)80062-6","volume":"17","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Casta\u00f1on, D.A.: Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput. 17, 707\u2013732 (1991)","journal-title":"Parallel Comput."},{"key":"1791_CR3","volume-title":"Linear network optimization: algorithms and codes","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P.: Linear network optimization: algorithms and codes. MIT Press, Cambridge, MA (1991)"},{"key":"1791_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/0801026","volume":"1","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P.: The auction algorithm for shortest paths. SIAM J. Optim. 1, 425\u2013477 (1991)","journal-title":"SIAM J. Optim."},{"key":"1791_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00247653","volume":"1","author":"DP Bertsekas","year":"1992","unstructured":"Bertsekas, D.P.: Auction algorithms for network flow problems: a tutorial introduction. Comput. Optim. Appl. 1, 7\u201366 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"1791_CR6","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0803013","volume":"3","author":"DP Bertsekas","year":"1993","unstructured":"Bertsekas, D.P., Casta\u00f1on, D.A., Tsaknakis, H.: Reverse auction and the solution of inequality constrained assignment problems. SIAM J. Optim. 3, 268\u2013299 (1993)","journal-title":"SIAM J. Optim."},{"key":"1791_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01589405","volume":"42","author":"DP Bertsekas","year":"1988","unstructured":"Bertsekas, D.P., Eckstein, J.: Dual coordinate step methods for linear network flow problems. Math. Progr., Ser. B 42, 203\u2013243 (1988)","journal-title":"Math. Progr., Ser. B"},{"key":"1791_CR8","volume-title":"Introduction to linear optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to linear optimization. Athena Scientific, Belmont, MA (1997)"},{"key":"1791_CR9","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. Revised reprint. SIAM, Philadelphia, PA (2011)","DOI":"10.1137\/1.9781611972238"},{"issue":"5","key":"1791_CR10","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"HN Gabow","year":"1989","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput. 18(5), 1013\u20131036 (1989)","journal-title":"SIAM J. Comput."},{"key":"1791_CR11","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921\u2013940 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1791_CR12","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Op. Res. 15, 430\u2013466 (1990)","journal-title":"Math. Op. Res."},{"key":"1791_CR13","first-page":"153","volume":"71","author":"AV Goldberg","year":"1995","unstructured":"Goldberg, A.V., Kennedy, R.: An efficient cost scaling algorithm for the assignment problem. Math. Programm. 71, 153\u2013177 (1995)","journal-title":"Math. Programm."},{"issue":"4","key":"1791_CR14","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/S0895480194281185","volume":"10","author":"AV Goldberg","year":"1997","unstructured":"Goldberg, A.V., Kennedy, R.: Global price updates help. SIAM J. Discr. Math. 10(4), 551\u2013572 (1997)","journal-title":"SIAM J. Discr. Math."},{"key":"1791_CR15","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. Quart. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"1791_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nav.3800030404","volume":"2","author":"HW Kuhn","year":"1956","unstructured":"Kuhn, H.W.: Variants of the Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2, 253\u2013258 (1956)","journal-title":"Naval Res. Logist. Quart."},{"key":"1791_CR17","volume-title":"Combinatorial optimization: networks and matroids, Holt","author":"EL Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial optimization: networks and matroids, Holt. Rinehart & Winston, New York (1976)"},{"key":"1791_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"JB Orlin","year":"1992","unstructured":"Orlin, J.B., Ahuja, R.K.: New scaling algorithms for the assignment ad minimum mean cycle problems. Math. Programm. 54, 41\u201356 (1992)","journal-title":"Math. Programm."},{"key":"1791_CR19","doi-asserted-by":"crossref","unstructured":"Ramshaw, L., Tarjan, R.E., Weight-Scaling Algorithm, A., for Min-Cost Imperfect Matchings in Bipartite Graphs, : IEEE 53rd Annual Symposium on Foundations of Computer Science. New Brunswick, NJ 2012, 581\u2013590 (2012)","DOI":"10.1109\/FOCS.2012.9"},{"key":"1791_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01299157","volume":"4","author":"H Zaki","year":"1995","unstructured":"Zaki, H.: A comparison of two algorithms for the assignment problem. Comput. Optim. Appl. 4, 23\u201345 (1995)","journal-title":"Comput. Optim. Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01791-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01791-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01791-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:18:58Z","timestamp":1652199538000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01791-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,16]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1791"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01791-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,16]]},"assertion":[{"value":"26 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}