{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T01:18:43Z","timestamp":1771377523366,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"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":10393,"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,2]]},"DOI":"10.1016\/0166-218x(85)90006-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:04:08Z","timestamp":1034273048000},"page":"117-124","source":"Crossref","is-referenced-by-count":41,"title":["Minimum cost flow algorithms for series-parallel networks"],"prefix":"10.1016","volume":"10","author":[{"given":"Wolfgang W.","family":"Bein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Brucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90006-X_BIB1","series-title":"Proc. 8th Conf. Graphtheoretic Concepts in Computer Science","first-page":"25","article-title":"Network flows in trees and knapsack problems with nested constraints","author":"Brucker","year":"1982"},{"key":"10.1016\/0166-218X(85)90006-X_BIB2","series-title":"Topics in Operations Research and Mathematical Economics","first-page":"299","article-title":"An O(n log n)-algorithm for the minimum cost flow problem","author":"Brucker","year":"1984"},{"key":"10.1016\/0166-218X(85)90006-X_BIB3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/0318019","article-title":"Efficient algorithm for a selection problem with nested constraints and its application to a production-sales planning model","volume":"18","author":"Tamir","year":"1980","journal-title":"SIAM J. Control Optimization"},{"key":"10.1016\/0166-218X(85)90006-X_BIB4","series-title":"Further remarks on selection problems with nested constraints","author":"Tamir","year":"1979"},{"key":"10.1016\/0166-218X(85)90006-X_BIB5","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel diagraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8590006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8590006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:23:30Z","timestamp":1555176210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X8590006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0166218X8590006X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90006-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}