{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:13:42Z","timestamp":1781345622056,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,17]],"date-time":"2009-12-17T00:00:00Z","timestamp":1261008000000},"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":[[2011,11]]},"DOI":"10.1007\/s10107-009-0335-0","type":"journal-article","created":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T00:15:19Z","timestamp":1260922519000},"page":"153-176","source":"Crossref","is-referenced-by-count":21,"title":["Lexicography and degeneracy: can a pure cutting plane algorithm work?"],"prefix":"10.1007","volume":"130","author":[{"given":"Arrigo","family":"Zanette","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Egon","family":"Balas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,12,17]]},"reference":[{"key":"335_CR1","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 361\u2013372 (2006). Problems available at http:\/\/miplib.zib.de"},{"issue":"3","key":"335_CR2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1145\/355900.355909","volume":"6","author":"J.L. Arthur","year":"1980","unstructured":"Arthur J.L., Ravindran A.: PAGP, a partitioning algorithm for (linear) goal programming problems. ACM Trans. Math. Softw. 6(3), 378\u2013386 (1980)","journal-title":"ACM Trans. Math. Softw."},{"key":"335_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G., Natraj N.: Gomory cuts revisited. Oper. Res. Lett. 19, 1\u20139 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"335_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E. Balas","year":"2008","unstructured":"Balas E., Saxena A.: Optimizing over the split closure. Math. Program. A 113(2), 219\u2013240 (2008)","journal-title":"Math. Program. A"},{"issue":"3","key":"335_CR5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/1011060","volume":"11","author":"M.L. Balinski","year":"1969","unstructured":"Balinski M.L., Tucker A.W.: Duality theory of linear programs: a constructive approach with applications. SIAM Rev. 11(3), 347\u2013377 (1969)","journal-title":"SIAM Rev."},{"key":"335_CR6","first-page":"12","volume":"58","author":"R.E. Bixby","year":"1998","unstructured":"Bixby R.E., Ceria S., McZeal C.M., Savelsbergh M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"key":"335_CR7","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I. Borg","year":"2005","unstructured":"Borg I., Groenen P.J.F.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (2005)"},{"key":"335_CR8","unstructured":"Caprara, A., Fischetti, M.: Branch-and-cut algorithms. In: Annotated Bibliographies in Combinatorial Optimization, pp. 45\u201363 (1997)"},{"issue":"4","key":"335_CR9","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/ijoc.1090.0324","volume":"21","author":"W. Cook","year":"2008","unstructured":"Cook W., Dash S., Fukasawa R., Goycoolea M.: Numerically safe Gomory mixed-integer cuts. INFORMS J. Comput. 21(4), 641\u2013649 (2008)","journal-title":"INFORMS J. Comput."},{"key":"335_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G., Li Y.: Elementary closures for integer programs. Oper. Res. Lett. 28, 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"335_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2007","unstructured":"Fischetti M., Lodi A.: Optimizing over the first Chv\u00e1tal closure. Math. Program. B 110(1), 3\u201320 (2007)","journal-title":"Math. Program. B"},{"key":"335_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am. Soc."},{"key":"335_CR13","unstructured":"Gomory, R.E.: An Algorithm for the Mixed Integer Problem. Technical Report RM-2597, The RAND Cooperation (1960)"},{"key":"335_CR14","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"issue":"2","key":"335_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A.N. Letchford","year":"2002","unstructured":"Letchford A.N., Lodi A.: Strengthening Chv\u00e1tal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2), 74\u201382 (2002)","journal-title":"Oper. Res. Lett."},{"key":"335_CR16","first-page":"6","volume":"77","author":"F. Margot","year":"2008","unstructured":"Margot F.: Testing cut generators for mixed-integer linear programming. Optima 77, 6\u20139 (2008)","journal-title":"Optima"},{"key":"335_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser G., Wolsey L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"335_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02032309","volume":"1","author":"M. Tamiz","year":"1995","unstructured":"Tamiz M., Jones D.F., El-Darzi E.: A review of goal programming and its applications. Ann. Oper. Res. 1, 39\u201353 (1995)","journal-title":"Ann. Oper. Res."},{"key":"335_CR19","doi-asserted-by":"crossref","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Can pure cutting plane algorithms work? In: IPCO, vol. 5035 of Lecture Notes in Computer Science, pp. 416\u2013434. Springer (2008)","DOI":"10.1007\/978-3-540-68891-4_29"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0335-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0335-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0335-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:07Z","timestamp":1559109007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0335-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,17]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["335"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0335-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,17]]}}}