{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T05:11:28Z","timestamp":1710393088300},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0167-6377(92)90103-a","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"179-180","source":"Crossref","is-referenced-by-count":12,"title":["Solving linear bottleneck assignment problems via strong spanning trees"],"prefix":"10.1016","volume":"12","author":[{"given":"Ronald D","family":"Armstrong","sequence":"first","affiliation":[]},{"family":"Zhiying Jin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90103-A_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01580579","article-title":"A competitive (dual) simplex method for the assignment problem","volume":"34","author":"Balinski","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90103-A_BIB2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/net.3230210203","article-title":"Maximum matchings in bipartite graphs via strong spanning trees","volume":"21","author":"Balinski","year":"1991","journal-title":"Networks"},{"key":"10.1016\/0167-6377(92)90103-A_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02252026","article-title":"An augmenting path method for solving linear bottleneck assignment problems","volume":"19","author":"Derigs","year":"1978","journal-title":"Computing"},{"key":"10.1016\/0167-6377(92)90103-A_BIB4","first-page":"1102","article-title":"A production line assignment problem","author":"Fulkerson","year":"1953","journal-title":"Rand Res. Mem."},{"key":"10.1016\/0167-6377(92)90103-A_BIB5","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","article-title":"An improved algorithm for the bottleneck assignment problem","volume":"19","author":"Garfinkel","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(92)90103-A_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01582245","article-title":"Efficient dual simplex methods for the assignment problem","volume":"33","author":"Goldfarb","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90103-A_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1093\/comjnl\/6.3.241","article-title":"A note on assignment problems","volume":"6","author":"Page","year":"1963","journal-title":"Comput. J."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290103A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290103A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:44Z","timestamp":1552902644000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290103A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["016763779290103A"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90103-a","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}