{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T02:41:16Z","timestamp":1776220876632,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T00:00:00Z","timestamp":1513382400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10878-017-0240-z","type":"journal-article","created":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T10:52:56Z","timestamp":1513421576000},"page":"842-852","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Critical objective function values in linear sum assignment problems"],"prefix":"10.1007","volume":"35","author":[{"given":"Ivan","family":"Belik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Jornsten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,16]]},"reference":[{"issue":"2","key":"240_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(93)90054-R","volume":"45","author":"M Akgul","year":"1993","unstructured":"Akgul M (1993) A genuinely polynomial primal simplex algorithm for the assignment problem. Discrete Appl Math 45(2):93\u2013115","journal-title":"Discrete Appl Math"},{"issue":"3","key":"240_CR2","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","volume":"10","author":"ML Balinski","year":"1964","unstructured":"Balinski ML, Gomory RE (1964) A primal method for the assignment and transportation problems. Manage Sci 10(3):578\u2013593","journal-title":"Manage Sci"},{"issue":"3","key":"240_CR3","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.33.3.527","volume":"33","author":"ML Balinski","year":"1985","unstructured":"Balinski ML (1985) Signature methods for the assignment problem. Oper Res 33(3):527\u2013536","journal-title":"Oper Res"},{"key":"240_CR4","unstructured":"Beasley JE (2016) OR-library: assignment problem. Resource document. OR-library"},{"issue":"1","key":"240_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"DP Bertsekas","year":"1988","unstructured":"Bertsekas DP (1988) The auction algorithm: a distributed relaxation method for the assignment problem. Ann Oper Res 14(1):105\u2013123","journal-title":"Ann Oper Res"},{"issue":"1\u20133","key":"240_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01589405","volume":"42","author":"DP Bertsekas","year":"1988","unstructured":"Bertsekas DP, Eckstein J (1988) Dual coordinate step methods for linear network flow problems. Math Program 42(1\u20133):203\u2013243","journal-title":"Math Program"},{"key":"240_CR7","volume-title":"Assignment problems in parallel and distributed computing","author":"SH Bokhari","year":"2012","unstructured":"Bokhari SH (2012) Assignment problems in parallel and distributed computing, vol 32. Springer, New York"},{"key":"240_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"RE Burkard","year":"2009","unstructured":"Burkard RE, Dell\u2019Amico M, Martello S (2009) Assignment problems. Siam, Bangkok"},{"key":"240_CR9","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ins.2014.01.015","volume":"275","author":"CP Chen","year":"2014","unstructured":"Chen CP, Zhang CY (2014) Data-intensive applications, challenges, techniques and technologies: a survey on Big Data. Inf Sci 275:314\u2013347","journal-title":"Inf Sci"},{"issue":"1","key":"240_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"WH Cunningham","year":"1976","unstructured":"Cunningham WH (1976) A network simplex method. Math Program 11(1):105\u2013116","journal-title":"Math Program"},{"key":"240_CR11","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"2016","unstructured":"Dantzig G (2016) Linear programming and extensions. Princeton University Press, Princeton"},{"issue":"6","key":"240_CR12","first-page":"1324","volume":"10","author":"EA Dinic","year":"1969","unstructured":"Dinic EA, Kronrod MA (1969) An algorithm for the solution of the assignment problem. Soviet Math Dokl 10(6):1324\u20131326","journal-title":"Soviet Math Dokl"},{"issue":"3","key":"240_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1112\/jlms\/s1-21.3.219","volume":"1","author":"TE Easterfield","year":"1946","unstructured":"Easterfield TE (1946) A combinatorial algorithm. J Lond Math Soc 1(3):219\u2013226","journal-title":"J Lond Math Soc"},{"issue":"2","key":"240_CR14","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248\u2013264","journal-title":"J ACM"},{"key":"240_CR15","volume-title":"Parallel computing works!","author":"GC Fox","year":"2014","unstructured":"Fox GC, Williams RD, Messina GC (2014) Parallel computing works!. Morgan Kaufmann, Burlington"},{"issue":"2","key":"240_CR16","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"HN Garbow","year":"1985","unstructured":"Garbow HN (1985) Scaling algorithms for network problems. J Comput Syst Sci 31(2):148\u2013168","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"240_CR17","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","volume":"28","author":"MS Hung","year":"1980","unstructured":"Hung MS, Rom WO (1980) Solving the assignment problem by relaxation. Oper Res 28(4):969\u2013982","journal-title":"Oper Res"},{"key":"240_CR18","doi-asserted-by":"publisher","unstructured":"Kao YH, Krishnamachari B, Ra MR, Bai F (2017) Hermes: latency optimal task assignment for resource-constrained mobile computing. IEEE Trans Mobile Comput 16(11):3056\u20133069. \n                        https:\/\/doi.org\/10.1109\/TMC.2017.2679712","DOI":"10.1109\/TMC.2017.2679712"},{"key":"240_CR19","doi-asserted-by":"publisher","unstructured":"Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econom J Econom Soci 25(1):53\u201376. \n                        https:\/\/doi.org\/10.2307\/1907742","DOI":"10.2307\/1907742"},{"issue":"12","key":"240_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2(12):83\u201397","journal-title":"Naval Res Logist Q"},{"issue":"4","key":"240_CR21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/nav.3800030404","volume":"3","author":"HW Kuhn","year":"1956","unstructured":"Kuhn HW (1956) Variants of the Hungarian method for assignment problems. Naval Res Logist Q 3(4):253\u2013258","journal-title":"Naval Res Logist Q"},{"key":"240_CR22","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.parco.2014.04.008","volume":"46","author":"YY Liu","year":"2015","unstructured":"Liu YY, Wang S (2015) A scalable parallel genetic algorithm for the generalized assignment problem. Parallel Comput 46:98\u2013119","journal-title":"Parallel Comput"},{"key":"240_CR23","volume-title":"A distributed algorithm for constrained multi-robot task assignment for grouped tasks. Research Showcase@CMU","author":"L Luo","year":"2012","unstructured":"Luo L, Chakraborty N, Sycara K (2012) A distributed algorithm for constrained multi-robot task assignment for grouped tasks. Research Showcase@CMU. Carnegie Mellon University, Pittsburgh"},{"issue":"1","key":"240_CR24","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32\u201338","journal-title":"J Soc Ind Appl Math"},{"issue":"6","key":"240_CR25","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/TC.2013.31","volume":"62","author":"C Papagianni","year":"2013","unstructured":"Papagianni C, Leivadeas A, Papavassiliou S, Maglaris V, Cervello-Pastor C, Monje A (2013) On the optimal allocation of virtual resources in cloud computing networks. IEEE Trans Comput 62(6):1060\u20131071","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"240_CR26","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54(1):215\u2013231","journal-title":"Int J Prod Res"},{"key":"240_CR27","unstructured":"Roverso R, Naiem A, El-Beltagi M, El-Ansary S, Haridi S (2010) A GPU-enabled solver for time-constrained linear sum assignment problems. In: The 7th international conference on informatics and systems. IEEE, pp 1\u20136"},{"key":"240_CR28","doi-asserted-by":"crossref","unstructured":"Seow KT, Dang NH, Lee DH (2007) Towards an automated multiagent taxi-dispatch system. In: 2007 IEEE international conference on automation science and engineering. IEEE, pp 1045\u20131050","DOI":"10.1109\/COASE.2007.4341673"},{"issue":"3","key":"240_CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02289039","volume":"15","author":"RL Thorndike","year":"1950","unstructured":"Thorndike RL (1950) The problem of classification of personnel. Psychometrika 15(3):215\u2013235","journal-title":"Psychometrika"},{"issue":"2","key":"240_CR30","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230010206","volume":"1","author":"N Tomizawa","year":"1971","unstructured":"Tomizawa N (1971) On some techniques useful for solution of transportation network problems. Networks 1(2):173\u2013194","journal-title":"Networks"},{"key":"240_CR31","doi-asserted-by":"crossref","unstructured":"Zavlanos MM, Spesivtsev L, Pappas GJ (2008) A distributed auction algorithm for the assignment problem. In: The 47th IEEE conference on decision and control. IEEE, pp 1212\u20131217","DOI":"10.1109\/CDC.2008.4739098"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0240-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0240-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0240-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T05:24:51Z","timestamp":1521177891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0240-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,16]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["240"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0240-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,16]]}}}