{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:47Z","timestamp":1774946147879,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,4,1]],"date-time":"1984-04-01T00:00:00Z","timestamp":449625600000},"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":10699,"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,4]]},"DOI":"10.1016\/0095-8956(84)90023-6","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"161-188","source":"Crossref","is-referenced-by-count":91,"title":["Testing membership in matroid polyhedra"],"prefix":"10.1016","volume":"36","author":[{"given":"William H","family":"Cunningham","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90023-6_BIB1","unstructured":"R. E. Bixby, Private communication, 1980."},{"key":"10.1016\/0095-8956(84)90023-6_BIB2","unstructured":"R. E. Bixby, W. H. Cunningham, and D. M. Topkis, The poset of a polymatroid extreme point, Math. Oper. Res., in press."},{"key":"10.1016\/0095-8956(84)90023-6_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0024-3795(77)90003-9","article-title":"An unbounded matroid intersection polyhedron","volume":"16","author":"Cunningham","year":"1977","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0095-8956(84)90023-6_BIB4","doi-asserted-by":"crossref","unstructured":"W. H. Cunningham, Minimum cuts, modular functions, and matroid polyhedra, Networks, in press.","DOI":"10.1002\/net.3230150206"},{"key":"10.1016\/0095-8956(84)90023-6_BIB5","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)90023-6_BIB6","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinic","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0095-8956(84)90023-6_BIB7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent sets","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0095-8956(84)90023-6_BIB8","series-title":"Combinatorial Structures","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/0095-8956(84)90023-6_BIB9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A minmax relation for submodular functions on directed graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(84)90023-6_BIB10","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. Math."},{"key":"10.1016\/0095-8956(84)90023-6_BIB11","doi-asserted-by":"crossref","unstructured":"A. Frank, Finding feasible vectors of Edmonds-Giles polyhedra, J. Combin. Theory Ser. B, in press.","DOI":"10.1016\/0095-8956(84)90029-7"},{"key":"10.1016\/0095-8956(84)90023-6_BIB12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","article-title":"Blocking and anti-blocking pairs of polyhedra","volume":"1","author":"Fulkerson","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0095-8956(84)90023-6_BIB13","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)90023-6_BIB14","author":"Gr\u00f6tschel","year":"1981"},{"key":"10.1016\/0095-8956(84)90023-6_BIB15","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.7.3.334","article-title":"Computing maximal polymatroidal network flows","volume":"7","author":"Lawler","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0095-8956(84)90023-6_BIB16","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1145\/322326.322337","article-title":"Preemptive scheduling with release times, deadlines, and due times","volume":"29","author":"Martel","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(84)90023-6_BIB17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(78)90008-4","article-title":"Blocking, antiblocking, and pairs of matroids and polymatroids","volume":"25","author":"McDiarmid","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(84)90023-6_BIB18","author":"Padberg","year":"1981","journal-title":"Trees and Cuts"},{"key":"10.1016\/0095-8956(84)90023-6_BIB19","first-page":"394","article-title":"Selected applications of minimum cuts in networks","volume":"20","author":"Picard","year":"1982","journal-title":"INFOR-Canada J. Oper. Res. Inform. Process."},{"key":"10.1016\/0095-8956(84)90023-6_BIB20","article-title":"Ganzzahlige Polymatroid-Intersektions-Algorithmen","author":"Sch\u00f6nsleben","year":"1980"},{"key":"10.1016\/0095-8956(84)90023-6_BIB21","unstructured":"A. Schrijver, Private communication, 1981."},{"key":"10.1016\/0095-8956(84)90023-6_BIB22","author":"Welsh","year":"1976"},{"key":"10.1016\/0095-8956(84)90023-6_BIB23","unstructured":"L. Wolsey, Private communication, 1981."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900236?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900236?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:11Z","timestamp":1548881591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,4]]}},"alternative-id":["0095895684900236"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90023-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,4]]}}}