{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:58:12Z","timestamp":1648825092941},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90161-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"297-308","source":"Crossref","is-referenced-by-count":1,"title":["A geometrical interpretation of the Hungarian method"],"prefix":"10.1016","volume":"21","author":[{"given":"Hans Joachim","family":"Schmid","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90161-9_BIB1","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0012-365X(78)90161-9_BIB2","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0012-365X(78)90161-9_BIB3","series-title":"Boolean Methods in Operations Research and Related Areas","author":"Hammer (Iv\u00e1nescu)","year":"1968"},{"key":"10.1016\/0012-365X(78)90161-9_BIB4","series-title":"Th\u00e9orie des Graphe, Journ\u00e9es Internationales d'Etude \u00e0 Rome","first-page":"161","article-title":"A pseudo-Boolean approach to matching problems in graphs with applications to assignment and transportation problems","author":"Iv\u00e1nescu","year":"1967"},{"key":"10.1016\/0012-365X(78)90161-9_BIB5","doi-asserted-by":"crossref","first-page":"85","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\/0012-365X(78)90161-9_BIB6","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","article-title":"Algorithm for the assignment and transportation problems","volume":"5","author":"Monkres","year":"1957","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"10.1016\/0012-365X(78)90161-9_BIB7","series-title":"Dissertation","article-title":"Eine geometrische Deutung der Ungarischen Methode","author":"Schmid","year":"1974"},{"key":"10.1016\/0012-365X(78)90161-9_BIB8","first-page":"307","article-title":"Maximum number of iterations in the dual algorithm of the Kantorovicz-Hitchcock problem in linear programming","volume":"3","author":"Yeng-Jen","year":"1963","journal-title":"Chinese Math.-Acta"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901619?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901619?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:20:19Z","timestamp":1555140019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78901619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78901619"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90161-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}