{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:59:33Z","timestamp":1648803573059},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"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":12007,"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":[[1980,9]]},"DOI":"10.1016\/0166-218x(80)90045-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"251-254","source":"Crossref","is-referenced-by-count":3,"title":["An extended abstract of an indepth algorithmic and computational study for maximum flow problems"],"prefix":"10.1016","volume":"2","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darwin","family":"Klingman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Mote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Whitman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(80)90045-1_BIB1","series-title":"Technical Report 78\u201307","article-title":"Computational comparison of eight methods for the maximum network flow problem","author":"Cheung","year":"1978"},{"key":"10.1016\/0166-218X(80)90045-1_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","article-title":"A network simplex method","volume":"11","author":"Cunningham","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(80)90045-1_BIB3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0166-218X(80)90045-1_BIB4","series-title":"Research Report CCS 356","article-title":"Comprehensive computer evaluation and enhancement of maximum flow algorithms","author":"Glover","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:24:18Z","timestamp":1555136658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X80900451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["0166218X80900451"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(80)90045-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}