{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:28:35Z","timestamp":1710286115426},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0166-218x(97)88001-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"123-131","source":"Crossref","is-referenced-by-count":7,"title":["A strongly polynomial algorithm for the uniform balanced network flow problem"],"prefix":"10.1016","volume":"81","author":[{"given":"Maria Grazia","family":"Scutell\u00e1","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)88001-8_bib1","doi-asserted-by":"crossref","DOI":"10.1016\/S0377-2217(96)00142-7","article-title":"The balanced linear programming problem","author":"Ahuja","year":"1992"},{"key":"10.1016\/S0166-218X(97)88001-8_bib2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(86)90041-7","article-title":"Most and least uniform spanning trees","volume":"15","author":"Camerini","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)88001-8_bib3","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","article-title":"A generalization of max-flow min-cut","volume":"6","author":"Hoffman","year":"1974","journal-title":"Math. Programming"},{"issue":"3","key":"10.1016\/S0166-218X(97)88001-8_bib4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","article-title":"Balanced optimization problems","volume":"5","author":"Martello","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(97)88001-8_bib5","series-title":"Numerical Optimization","first-page":"351","article-title":"Parametric flows, weighted means of cuts and fractional combinatorial optimization","author":"Radzik","year":"1993"},{"key":"10.1016\/S0166-218X(97)88001-8_bib6","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm for solving combinatorial linear programs","volume":"34","author":"Tardos","year":"1986","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97880018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97880018?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:50:50Z","timestamp":1556117450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97880018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0166218X97880018"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)88001-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}