{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:41:02Z","timestamp":1759848062018},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,4,9]],"date-time":"2011-04-09T00:00:00Z","timestamp":1302307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10107-011-0450-6","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T01:11:09Z","timestamp":1302225069000},"page":"509-514","source":"Crossref","is-referenced-by-count":2,"title":["A hard integer program made easy by lexicography"],"prefix":"10.1007","volume":"135","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arrigo","family":"Zanette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"450_CR1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10107-010-0392-4","volume":"125","author":"E. Balas","year":"2010","unstructured":"Balas E., Fischetti M., Zanette A.: On the enumerative nature of Gomory\u2019s dual cutting plane method. Math. Program. Ser. B 125, 325\u2013351 (2010)","journal-title":"Math. Program. Ser. B"},{"key":"450_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/321062.321063","volume":"8","author":"D. Knuth","year":"1961","unstructured":"Knuth D.: Minimizing drum latency time. J. ACM 8, 119\u2013150 (1961)","journal-title":"J. ACM"},{"key":"450_CR3","unstructured":"Knuth, D.: An integer programming problem. Manuscr. July (1993)"},{"key":"450_CR4","unstructured":"Knuth, D.: Selected Papers on Design of Algorithms, pp. 435\u2013436. CSLI Lecture Notes no. 191, Stanford, California, February (2010)"},{"key":"450_CR5","doi-asserted-by":"crossref","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. Ser. A (2009). doi: 10.1007\/s10107-009-0335-0","DOI":"10.1007\/s10107-009-0335-0"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0450-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0450-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0450-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:09Z","timestamp":1559123409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0450-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,9]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["450"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0450-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,9]]}}}