{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T09:04:00Z","timestamp":1695632640016},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1984,12]]},"DOI":"10.1007\/bf02579138","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:14:52Z","timestamp":1174583692000},"page":"281-290","source":"Crossref","is-referenced-by-count":5,"title":["Path-closed sets"],"prefix":"10.1007","volume":"4","author":[{"given":"Heinz","family":"Gr\u00f6flin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579138_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth, A decomposition theorem for partially ordered sets,Ann. Math. 51 (1950), 161\u2013166.","journal-title":"Ann. Math."},{"key":"BF02579138_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, Matroids and the greedy algorithm,Mathematical Programming 1 (1971), 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"BF02579138_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs, in:Studies in Integer Programming, Annals of Discrete Mathematics 1 (1977), 185\u2013204.","journal-title":"Studies in Integer Programming, Annals of Discrete Mathematics"},{"key":"BF02579138_CR4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D. R. Fulkerson","year":"1971","unstructured":"D. R. Fulkerson, Blocking and Antiblocking Polyhedra,Mathematical Programming 1 (1971), 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"BF02579138_CR5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D. R. Fulkerson","year":"1972","unstructured":"D. R. Fulkerson, Anti-blocking polyhedra,Journal of Combinatorial Theory 12 (1972), 50\u201371.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF02579138_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","volume":"25","author":"F. R. Giles","year":"1979","unstructured":"F. R. Giles andW. R. Pulleyblank, Total dual integrality and integer polyhedra,Lin. Algebra and Appl. 25 (1979), 191\u2013196.","journal-title":"Lin. Algebra and Appl."},{"key":"BF02579138_CR7","unstructured":"H. Gr\u00f6flin,On a general antiblocking relation and some integer polyhedra, Habilitationsschrift ETH (Z\u00fcrich, April 1982)."},{"key":"BF02579138_CR8","unstructured":"H. Gr\u00f6flin, On node constraint networks,IFOR Technical Report, ETH (Z\u00fcrich, December 1982)."},{"key":"BF02579138_CR9","unstructured":"H. Gr\u00f6flin, On Switching paths polyhedra,IFOR Technical Report, ETH (Z\u00fcrich, May 1982)."},{"key":"BF02579138_CR10","first-page":"189","volume":"15","author":"H. Gr\u00f6flin","year":"1982","unstructured":"H. Gr\u00f6flin andA. J. Hoffman, Lattice polyhedra II: generalization, constructions and examples,Ann. Discrete Math. 15 (1982), 189\u2013203.","journal-title":"Ann. Discrete Math."},{"key":"BF02579138_CR11","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A. J. Hoffman","year":"1974","unstructured":"A. J. Hoffman, A generalization of max flow-min cut,Mathematical Programming 6 (1974), 352\u2013359.","journal-title":"Mathematical Programming"},{"key":"BF02579138_CR12","unstructured":"A. J. Hoffman, On lattice polyhedra II: construction and examples,IBM Research Rep. RC 6268, (1976)."},{"key":"BF02579138_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0121202","volume":"9","author":"A. J. Hoffman","year":"1978","unstructured":"A. J. Hoffman, On lattice polyhedra III: blockers and anti-blockers of lattice clutters,Math. Programming Study 9 (1978), 197\u2013207.","journal-title":"Math. Programming Study"},{"key":"BF02579138_CR14","first-page":"593","volume-title":"Combinatorics: Proc. 5th Hung. Coll. on Comb.","author":"A. J. Hoffman","year":"1978","unstructured":"A. J. Hoffman andD. E. Schwartz, On lattice polyhedra, inCombinatorics: Proc. 5th Hung. Coll. on Comb. (A. Hajnal and V. T. S\u00f3s eds.) (North-Holland, Amsterdam, 1978), 593\u2013598."},{"key":"BF02579138_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121201","volume":"8","author":"E. L. Johnson","year":"1978","unstructured":"E. L. Johnson, Support functions, blocking pairs and antiblocking pairs,Mathematical Programming Study 8 (1978), 167\u2013196.","journal-title":"Mathematical Programming Study"},{"key":"BF02579138_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0024-3795(81)90005-7","volume":"38","author":"A. Schrijver","year":"1981","unstructured":"A. Schrijver, On total dual integrality,Lin. Algebra and Appl. 38 (1981), 27\u201332.","journal-title":"Lin. Algebra and Appl."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579138.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579138\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:44:58Z","timestamp":1558183498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["BF02579138"],"URL":"https:\/\/doi.org\/10.1007\/bf02579138","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}