{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:54:41Z","timestamp":1648540481305},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf01498334","type":"journal-article","created":{"date-parts":[[2005,4,18]],"date-time":"2005-04-18T14:49:07Z","timestamp":1113835747000},"page":"435-436","source":"Crossref","is-referenced-by-count":0,"title":["Book review"],"prefix":"10.1007","volume":"35","author":[{"given":"A. M. H.","family":"Gerards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1:169?197. [corrigendum: 4(1984):291?295]","journal-title":"Combinatorica"},{"key":"CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization, Springer, Berlin"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra HW Jr (1983) Integer programming with a fixed number of variables, Math Oper Res 8:538?548","journal-title":"Math Oper Res"},{"key":"CR4","first-page":"1093","volume":"244","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan LG (1979) A polynomial algorithm in linear programming (in Russian), Dokl Akad Nauk SSSR 244:1093?1096. [English Translation: Soviet Math Dokl 20:191?194]","journal-title":"Dokl Akad Nauk SSSR"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW Jr, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients, Math Ann 261:515?534","journal-title":"Math Ann"}],"container-title":["ZOR - Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01498334.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01498334\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01498334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:59:17Z","timestamp":1556902757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01498334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF01498334"],"URL":"https:\/\/doi.org\/10.1007\/bf01498334","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}