{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:32:25Z","timestamp":1768915945388,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00208-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:08:03Z","timestamp":1027577283000},"page":"265-271","source":"Crossref","is-referenced-by-count":10,"title":["On the flow cost lowering problem"],"prefix":"10.1016","volume":"137","author":[{"given":"I.","family":"Demgensky","sequence":"first","affiliation":[]},{"given":"H.","family":"Noltemeier","sequence":"additional","affiliation":[]},{"given":"H.-C.","family":"Wirth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00208-9_BIB1","series-title":"Networks Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(01)00208-9_BIB2","doi-asserted-by":"crossref","unstructured":"U. Feige, A threshold of lnn for approximating set cover, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96), 1996, pp. 314\u2013318","DOI":"10.1145\/237814.237977"},{"key":"10.1016\/S0377-2217(01)00208-9_BIB3","series-title":"Computers and Intractability (A Guide to the Theory of NP-Completeness)","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(01)00208-9_BIB4","doi-asserted-by":"crossref","unstructured":"S.O. Krumke, H. Noltemeier, R. Ravi, S. Schwarz, H.-C. Wirth, Flow improvement and flows with fixed costs, in: H.-J. L\u00fcthi, P. Kall (Eds.), Proceedings of the International Conference of Operations Research Z\u00fcrich (OR'98), Operations Research Proceedings, Springer, Berlin, 1999","DOI":"10.1007\/978-3-642-58409-1_15"},{"key":"10.1016\/S0377-2217(01)00208-9_BIB5","unstructured":"B. Schoenmakers, A new algorithm for the recognition of series parallel graphs, Technical Report CS-R9504, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, 1995"},{"issue":"2","key":"10.1016\/S0377-2217(01)00208-9_BIB6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series\u2013parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:50:04Z","timestamp":1578430204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002089"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00208-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}