{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:11:50Z","timestamp":1775286710676,"version":"3.50.1"},"reference-count":3,"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\/bf02579139","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:14:52Z","timestamp":1174583692000},"page":"291-295","source":"Crossref","is-referenced-by-count":42,"title":["Corrigendum to our paper \u201cthe ellipsoid method and its consequences in combinatorial optimization\u201d"],"prefix":"10.1007","volume":"4","author":[{"given":"M.","family":"Gr\u00f6tschel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Schrijver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02579139_CR1","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz andA. Schrijver, The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 169\u2013197.","journal-title":"Combinatorica"},{"key":"BF02579139_CR2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"P. M. Jensen","year":"1982","unstructured":"P. M. Jensen andB. Korte, Complexity of matroid property algorithms,SIAM J. Computing 11 (1982), 184\u2013190.","journal-title":"SIAM J. Computing"},{"key":"BF02579139_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. W. Padberg","year":"1982","unstructured":"M. W. Padberg andM. R. Rao, Odd minimum cut-sets andb-matchings,Math. Oper. Res. 7 (1982), 67\u201380.","journal-title":"Math. Oper. Res."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579139.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579139\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579139","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\/BF02579139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["BF02579139"],"URL":"https:\/\/doi.org\/10.1007\/bf02579139","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}