{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:18:49Z","timestamp":1759133929042},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0377-2217(98)00361-0","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"233-234","source":"Crossref","is-referenced-by-count":5,"title":["Linear assignment procedures"],"prefix":"10.1016","volume":"116","author":[{"given":"R","family":"Jonker","sequence":"first","affiliation":[]},{"given":"A","family":"Volgenant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00361-0_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01919285","article-title":"An in-core\/out-of-core method for solving large scale assignment problems","volume":"30","author":"Derigs","year":"1986","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585996","article-title":"An efficient cost scaling algorithm for the assignment problem","volume":"71","author":"Goldberg","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB3","doi-asserted-by":"crossref","unstructured":"Hao, J., Kocur, G., 1993. An Implementation of a Shortest Augmenting Path Algorithm for the Assignment Problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, pp. 453\u2013468","DOI":"10.1090\/dimacs\/012\/18"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest augmenting path algorithm for dense and sparse linear assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB5","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.40.1.178","article-title":"A shortest augmenting path algorithm for the semi-assignment problem","volume":"40","author":"Kennington","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(94)90039-6","article-title":"Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem","volume":"55","author":"Punnen","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230010206","article-title":"On some techniques useful for the solution of transportation problems","volume":"1","author":"Tomizawa","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00361-0_BIB8","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/0305-0548(96)00010-X","article-title":"Linear and semi assignment problems: A core oriented approach","volume":"23","author":"Volgenant","year":"1996","journal-title":"Computers & Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003610?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003610?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T09:20:18Z","timestamp":1556097618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0377221798003610"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00361-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}