{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:06Z","timestamp":1759063686385},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01589348","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:22:39Z","timestamp":1114676559000},"page":"233-244","source":"Crossref","is-referenced-by-count":9,"title":["Connected and alternating vectors: Polyhedra and algorithms"],"prefix":"10.1007","volume":"20","author":[{"given":"Heinz","family":"Gr\u00f6flin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"68","volume-title":"Combinatorial structures and their applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds, \u201cSubmodular functions, matroids and certain polyhedra\u201d, in:Combinatorial structures and their applications (Gordon and Breach, New York, 1970) 68\u201387."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, \u201cMatroids and the greedy algorithm\u201d,Mathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, \u201cMatroid intersection\u201d,Annals of Discrete Mathematics 4 (1979) 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR4","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 and R. Giles, \u201cA min\u2014max relation for submodular functions on graphs\u201d, in:Studies in Integer Programming, Annals of Discrete Mathematics 1 (1977) 185\u2013204.","journal-title":"Studies in Integer Programming, Annals of Discrete Mathematics"},{"issue":"B","key":"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, \u201cAntiblocking polyhedra\u201d,Journal of Combinatorial Theory 12(B) (1972) 50\u201371.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR6","volume-title":"Submodular functions, graphs and integer polyhedra","author":"R. Giles","year":"1975","unstructured":"R. Giles, \u201cSubmodular functions, graphs and integer polyhedra\u201d, Thesis, University of Waterloo (Waterloo, Ont., 1975)."},{"key":"CR7","volume-title":"\u201cConsecutive and alternating vectors: Polyhedra and algorithms\u201d, IFOR Technical Report","author":"H. Gr\u00f6flin","year":"1978","unstructured":"H. Gr\u00f6flin and Th.M. Liebling, \u201cConsecutive and alternating vectors: Polyhedra and algorithms\u201d, IFOR Technical Report, ETH (Z\u00fcrich, August 1978)."},{"key":"CR8","first-page":"223","volume-title":"Annals of Mathematical Study 38","author":"A.J. Hoffman","year":"1956","unstructured":"A.J. Hoffman and J.B. Kruskal, \u201cIntegral boundary points of convex polyhedra\u201d, in:Annals of Mathematical Study 38, (Princeton University Press, Princeton, NJ, 1956) 223\u2013241."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A.J. Hoffman","year":"1974","unstructured":"A.J. Hoffman, \u201cA generalization of max flow\u2014min cut,Mathematical Programming 6 (1974) 352\u2013359.","journal-title":"Mathematical Programming"},{"key":"CR10","first-page":"593","volume-title":"Proceedings of Colloquium on Graph Theory and Combinatorics, Kesztheley (1975)","author":"A.J. Hoffman","year":"1978","unstructured":"A.J. Hoffman and D.E. Schwartz, \u201cOn lattice polyhedra\u201d,Proceedings of Colloquium on Graph Theory and Combinatorics, Kesztheley (1975) (North-Holland, Amsterdam, 1978) 593\u2013598."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589348.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589348\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:36:35Z","timestamp":1556883395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01589348"],"URL":"https:\/\/doi.org\/10.1007\/bf01589348","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}