{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:22:45Z","timestamp":1649136165870},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10273,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/s0166-218x(85)80001-9","type":"journal-article","created":{"date-parts":[[2005,7,12]],"date-time":"2005-07-12T20:06:18Z","timestamp":1121198778000},"page":"95-102","source":"Crossref","is-referenced-by-count":1,"title":["A case of non-convergent dual changes in assignment problems"],"prefix":"10.1016","volume":"11","author":[{"given":"Juli\u00e1n","family":"Ar\u00e1oz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Edmonds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(85)80001-9_bib1","series-title":"Fundamentals of Operations Research","author":"Ackoff","year":"1968"},{"key":"10.1016\/S0166-218X(85)80001-9_bib2","series-title":"Linear Programming and Network Flows","author":"Bazaraa","year":"1977"},{"key":"10.1016\/S0166-218X(85)80001-9_bib3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(85)80001-9_bib4","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0166-218X(85)80001-9_bib5","series-title":"Introduction to Operations Research","author":"Hillier","year":"1967"},{"key":"10.1016\/S0166-218X(85)80001-9_bib6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(85)80001-9_bib7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres","year":"1957","journal-title":"J. Soc. Indust. Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X85800019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X85800019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:54:10Z","timestamp":1548345250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X85800019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["S0166218X85800019"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(85)80001-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}