{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:40:36Z","timestamp":1784238036842,"version":"3.55.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"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":10638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1016\/0095-8956(84)90029-7","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"221-239","source":"Crossref","is-referenced-by-count":37,"title":["Finding feasible vectors of Edmonds-Giles polyhedra"],"prefix":"10.1016","volume":"36","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90029-7_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(84)90023-6","article-title":"Testing membership in matroid polyhedra","volume":"36","author":"Cunningham","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(84)90029-7_BIB2","doi-asserted-by":"crossref","unstructured":"W. H. Cunningham and A. Frank, A primal-dual algorithm for submodular flows, Math. Oper. Res., in press.","DOI":"10.1287\/moor.10.2.251"},{"key":"10.1016\/0095-8956(84)90029-7_BIB3","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinitz","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0095-8956(84)90029-7_BIB4","series-title":"Studies in Integer Programming Proceedings, Workshop on Programming","first-page":"185","article-title":"A min-max relation for submodular functions on graphs","author":"Edmonds","year":"1975"},{"key":"10.1016\/0095-8956(84)90029-7_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","article-title":"Matroid intersection","volume":"4","author":"Edmonds","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(84)90029-7_BIB6","series-title":"Combinatorial Structures and Their Applications, Proceedings, International Conference","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/0095-8956(84)90029-7_BIB7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(84)90029-7_BIB8","author":"Ford","year":"1962"},{"key":"10.1016\/0095-8956(84)90029-7_BIB9","first-page":"97","article-title":"An algorithm for submodular functions on graphs","volume":"16","author":"Frank","year":"1982","journal-title":"Ann. Discrete Math."},{"issue":"No. 2","key":"10.1016\/0095-8956(84)90029-7_BIB10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02579270","article-title":"How to make a digraph strongly connected","volume":"1","author":"Frank","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(84)90029-7_BIB11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","article-title":"A weighted matroid intersection algorithm","volume":"2","author":"Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0095-8956(84)90029-7_BIB12","first-page":"63","article-title":"Kernel systems of directed graphs","volume":"41","author":"Frank","year":"1979","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"10.1016\/0095-8956(84)90029-7_BIB13","author":"Frank","year":"1981"},{"key":"10.1016\/0095-8956(84)90029-7_BIB14","series-title":"Proceedings, Silver Jubilee Conference on Combinatorics","article-title":"Submodular flows","author":"Frank","year":"1982"},{"issue":"No. 2","key":"10.1016\/0095-8956(84)90029-7_BIB15","first-page":"189","article-title":"Algorithms for solving the independent flow problems","volume":"21","author":"Fujishige","year":"1978","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"No. 2","key":"10.1016\/0095-8956(84)90029-7_BIB16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(84)90029-7_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230120102","article-title":"On network flows","volume":"12","author":"Hassin","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0095-8956(84)90029-7_BIB18","first-page":"113","article-title":"Some recent applications of the theory of linear inequalities to extremal combinatorial analysis","volume":"10","author":"Hoffman","year":"1966"},{"issue":"No. 3","key":"10.1016\/0095-8956(84)90029-7_BIB19","doi-asserted-by":"crossref","DOI":"10.1287\/moor.7.3.334","article-title":"Computing maximal \u201cpolymatroidal\u201d network flows","volume":"7","author":"Lawler","year":"1982","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/0095-8956(84)90029-7_BIB20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","article-title":"A minimax theorem for directed graphs","volume":"17","author":"Lucchesi","year":"1978","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(84)90029-7_BIB21","series-title":"Recent Progress in Combinatorics","article-title":"Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings","author":"Nash-Williams","year":"1969"},{"issue":"No. 1","key":"10.1016\/0095-8956(84)90029-7_BIB22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0167-6377(81)90021-3","article-title":"Total dual integrality and b-matchings","volume":"1","author":"Pulleyblank","year":"1981","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0095-8956(84)90029-7_BIB23","article-title":"Ganzzahlige Polymatroid-Intersektions-Algorithmen","author":"Sch\u00f6nsleben","year":"1980"},{"key":"10.1016\/0095-8956(84)90029-7_BIB24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0024-3795(81)90005-7","article-title":"On total dual integrality","volume":"38","author":"Schrijver","year":"1981","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0095-8956(84)90029-7_BIB25","series-title":"Proceedings, Silver Jubilee Conference on Combinatorics","article-title":"Total dual integrality from directed graphs, crossing families, and sub- and supermodular functions","author":"Schrijver","year":"1982"},{"key":"10.1016\/0095-8956(84)90029-7_BIB26","first-page":"287","article-title":"Minimization of some nonlinear functions over polymatroidal network flows","volume":"16","author":"Zimmermann","year":"1982","journal-title":"Ann. Discrete Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:53:01Z","timestamp":1548881581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0095895684900297"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90029-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}