{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:51:06Z","timestamp":1768074666589,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,7,30]],"date-time":"2010-07-30T00:00:00Z","timestamp":1280448000000},"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":[[2010,10]]},"DOI":"10.1007\/s10107-010-0392-4","type":"journal-article","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:12:37Z","timestamp":1280387557000},"page":"325-351","source":"Crossref","is-referenced-by-count":8,"title":["On the enumerative nature of Gomory\u2019s dual cutting plane method"],"prefix":"10.1007","volume":"125","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":[[2010,7,30]]},"reference":[{"key":"392_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34, 361\u2013372 (2006). Problems available at http:\/\/miplib.zib.de","DOI":"10.1016\/j.orl.2005.07.009"},{"issue":"3","key":"392_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."},{"issue":"2","key":"392_CR3","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. 113(2), 219\u2013240 (2008)","journal-title":"Math. Program."},{"issue":"3","key":"392_CR4","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":"392_CR5","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":"392_CR6","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, Berlin (2005)"},{"key":"392_CR7","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"392_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook W., Kannan R., Schrijver A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"392_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-008-0225-x","volume":"121","author":"S. Dash","year":"2010","unstructured":"Dash S., G\u00fcnl\u00fck O., Lodi A.: MIR closures of polyhedral sets. Math. Program. 121, 33\u201360 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"392_CR10","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":"392_CR11","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":"392_CR12","unstructured":"Gomory, R.E.: An Algorithm for the Mixed Integer Problem. Technical Report RM-2597, The RAND Corporation (1960)"},{"key":"392_CR13","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 programming. In: Graves, R.L., Wolfe, P. (eds) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"392_CR14","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, London (1988)"},{"key":"392_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(82)90014-1","volume":"1","author":"F.J. Nourie","year":"1982","unstructured":"Nourie F.J., Venta E.R.: An upper bound on the number of cuts needed in Gomory\u2019s method of integer forms. Oper. Res. Lett. 1, 129\u2013133 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"392_CR16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02032309","volume":"58","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. 58(1), 39\u201353 (1995)","journal-title":"Ann. Oper. Res."},{"key":"392_CR17","doi-asserted-by":"crossref","unstructured":"Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: Can a pure cutting plane algorithm work? Math. Program. (2010, to appear)","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-010-0392-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0392-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0392-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:37:50Z","timestamp":1559345870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0392-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,30]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0392-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,30]]}}}