{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:17:55Z","timestamp":1648927075772},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"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":[[1997,3]]},"DOI":"10.1016\/s0166-218x(96)00011-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"261-273","source":"Crossref","is-referenced-by-count":1,"title":["A cost-scaling algorithm for 0\u20131 submodular flows"],"prefix":"10.1016","volume":"73","author":[{"given":"Maiko","family":"Shigeno","sequence":"first","affiliation":[]},{"given":"Satoru","family":"Iwata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00011-X_BIB1","series-title":"Combinatorial Structures and Their Applications","first-page":"69","article-title":"Submodular functions, matroids and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB2","series-title":"Studies in Integer Programming","first-page":"185","article-title":"A min-max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB3","series-title":"Bonn Workshop on Combinatorial Optimization","first-page":"97","article-title":"An algorithm for submodular functions on graphs","volume":"16","author":"Frank","year":"1982"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0095-8956(84)90029-7","article-title":"Finding feasible vectors of Edmonds-Giles polyhedra","volume":"36","author":"Frank","year":"1984","journal-title":"J.Combin. Theory, Ser. B"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB5","series-title":"Proceedings of the 6th Hungarian Combinatorial Colloquium","first-page":"295","article-title":"Matroids from crossing families","author":"Frank","year":"1981"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF01589418","article-title":"Generalized polymatroids and submodular flows","volume":"42","author":"Frank","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB7","article-title":"Submodular Functions and Optimization","volume":"47","author":"Fujishige","year":"1991"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB8","first-page":"124","article-title":"An efficient cost scaling algorithm for the independent assignment problem","volume":"38","author":"Fujishige","year":"1995","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB9","series-title":"Proceedings of the 34th IEEE Annual Symposium on the Foundations of Computer Science","first-page":"449","article-title":"A framework for cost-scaling algorithms for submodular flow problems","author":"Gabow","year":"1993"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB10","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","article-title":"Faster scaling algorithm for network problems","volume":"18","author":"Gabow","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00011-X_BIB11","series-title":"Proceedings of the 30th IEEE Annual Symposium on the Foundations of Computer Science","first-page":"106","article-title":"Efficient algorithms for independent assignment on graphic and linear matroids","author":"Gabow","year":"1989"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB12","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01585712","article-title":"A note on the Frank-Tardos bitruncation algorithm for crossing-submodular functions","volume":"53","author":"Naitoh","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","article-title":"New scaling algorithms for the assignment and minimum mean cycle problems","volume":"54","author":"Orlin","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(96)00011-X_BIB15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0166-218X(82)90053-1","article-title":"Minimization on submodular flows","volume":"4","author":"Zimmermann","year":"1982","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600011X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600011X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:28:29Z","timestamp":1556116109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9600011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0166218X9600011X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00011-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}