{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:16Z","timestamp":1761596776847},"reference-count":10,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"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":9755,"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":[[1986,11]]},"DOI":"10.1016\/0166-218x(86)90037-5","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T12:34:42Z","timestamp":1032266082000},"page":"135-144","source":"Crossref","is-referenced-by-count":6,"title":["Greedy concepts for network flow problems"],"prefix":"10.1016","volume":"15","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"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90037-5_BIB1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/0606048","article-title":"On transportation problems with upper bounds on leading rectangles","volume":"3","author":"Barnes","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(86)90037-5_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(85)90006-X","article-title":"Minimum cost flow algorithms for series-parallel networks","volume":"10","author":"Bein","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(86)90037-5_BIB3","series-title":"Linear-time computation of optimal subgraphs of decomposible graphs","author":"Bern","year":"1985"},{"key":"10.1016\/0166-218X(86)90037-5_BIB4","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(86)90037-5_BIB5","series-title":"Topics in Operations Research and Mathematical Economics","first-page":"299","article-title":"An O(nlogn)-algorithm for the minimum cost flow problem in trees","author":"Brucker","year":"1984"},{"key":"10.1016\/0166-218X(86)90037-5_BIB6","series-title":"The greedy procedure for resource allocation problems: necessary and sufficient conditions for optimality","author":"Federgruen","year":"1983"},{"key":"10.1016\/0166-218X(86)90037-5_BIB7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state-variable machine: A solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(86)90037-5_BIB8","series-title":"Surveys in Combinatorics 1985","first-page":"97","article-title":"On greedy algorithms that succeed","author":"Hoffman","year":"1985"},{"key":"10.1016\/0166-218X(86)90037-5_BIB9","series-title":"Mathematical Programming","first-page":"235","article-title":"Submodular functions and convexity","author":"Lov\u00e1sz","year":"1982"},{"key":"10.1016\/0166-218X(86)90037-5_BIB10","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:0166218X86900375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T13:22:48Z","timestamp":1554816168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["0166218X86900375"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90037-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}