{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:06Z","timestamp":1740109266375,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T00:00:00Z","timestamp":1493769600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T00:00:00Z","timestamp":1493769600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI1452820"],"award-info":[{"award-number":["CMMI1452820"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10107-017-1153-4","type":"journal-article","created":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T12:41:02Z","timestamp":1493815262000},"page":"329-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimal cut-generating functions are nearly extreme"],"prefix":"10.1007","volume":"172","author":[{"given":"Amitabh","family":"Basu","sequence":"first","affiliation":[]},{"given":"Robert","family":"Hildebrand","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,3]]},"reference":[{"issue":"1","key":"1153_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2011.11.002","volume":"9","author":"E Balas","year":"2012","unstructured":"Balas, E., Qualizza, A.: Monoidal cut strengthening revisited. Discrete Optim. 9(1), 40\u201349 (2012)","journal-title":"Discrete Optim."},{"key":"1153_CR2","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/moor.1100.0461","volume":"35","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35, 704\u2013720 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1153_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10107-015-0890-5","volume":"151","author":"A Basu","year":"2015","unstructured":"Basu, A., Conforti, M., Di Summa, M.: A geometric approach to cut-generating functions. Math. Program. 151(1), 153\u2013189 (2015)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1153_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0639-y","volume":"145","author":"A Basu","year":"2013","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: The triangle closure is a polyhedron. Math. Program. Ser. A 145(1\u20132), 1\u201340 (2013). doi:\n                    10.1007\/s10107-013-0639-y\n                    \n                  . Published online 23 February (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"1153_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-015-0292-9","volume":"14","author":"A Basu","year":"2016","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Light on the infinite group relaxation I: foundations and taxonomy. 4OR 14(1), 1\u201340 (2016)","journal-title":"4OR"},{"issue":"2","key":"1153_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10288-015-0293-8","volume":"14","author":"Amitabh Basu","year":"2015","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M.: Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR 14(2), 107\u2013131 (2016)","journal-title":"4OR"},{"issue":"2","key":"1153_CR7","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1137\/110848608","volume":"23","author":"A Basu","year":"2013","unstructured":"Basu, A., Hildebrand, R., K\u00f6ppe, M., Molinaro, M.: A $$(k+1)$$-slope theorem for the $$k$$-dimensional infinite group relaxation. SIAM J. Optim. 23(2), 1021\u20131040 (2013). doi:\n                    10.1137\/110848608","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1153_CR8","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"Valentin Borozan","year":"2009","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34, 538\u2013546 (2009). doi:\n                    10.1287\/moor.1080.0370\n                    \n                  . \n                    http:\/\/portal.acm.org\/citation.cfm?id=1599452.1599455","journal-title":"Mathematics of Operations Research"},{"key":"1153_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10107-008-0221-1","volume":"120","author":"G Cornu\u00e9jols","year":"2009","unstructured":"Cornu\u00e9jols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. Math. Program. 120, 429\u2013456 (2009). doi:\n                    10.1007\/s10107-008-0221-1","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1153_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-012-0562-7","volume":"142","author":"G Cornu\u00e9jols","year":"2013","unstructured":"Cornu\u00e9jols, G., Molinaro, M.: A 3-slope theorem for the infinite relaxation in the plane. Math. Program. 142(1\u20132), 83\u2013105 (2013). doi:\n                    10.1007\/s10107-012-0562-7","journal-title":"Math. Program."},{"issue":"2","key":"1153_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2009.10.016","volume":"38","author":"DG Espinoza","year":"2010","unstructured":"Espinoza, D.G.: Computing with multi-row Gomory cuts. Oper. Res. Lett. 38(2), 115\u2013120 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1153_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3-3","author":"Ralph E. Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, I. Math. Program. 3, 23\u201385 (1972). doi:\n                    10.1007\/BF01585008","journal-title":"Mathematical Programming"},{"key":"1153_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, II. Math. Program. 3, 359\u2013389 (1972). doi:\n                    10.1007\/BF01585008","journal-title":"Math. Program."},{"key":"1153_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10107-003-0389-3","volume":"96","author":"RE Gomory","year":"2003","unstructured":"Gomory, R.E., Johnson, E.L.: T-space and cutting planes. Math. Program. 96, 341\u2013375 (2003). doi:\n                    10.1007\/s10107-003-0389-3","journal-title":"Math. Program."},{"key":"1153_CR15","volume-title":"Functional Analysis and Semi-Groups","author":"E Hille","year":"1957","unstructured":"Hille, E., Phillips, R.: Functional Analysis and Semi-Groups. American Mathematical Society, Providence (1957)"},{"key":"1153_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"EL Johnson","year":"1974","unstructured":"Johnson, E.L.: On the group problem for mixed integer programming. Math. Program. Study 2, 137\u2013179 (1974)","journal-title":"Math. Program. Study"},{"volume-title":"Matrix Analysis and Applied Linear Algebra","year":"2000","key":"1153_CR17","unstructured":"Meyer, C.D. (ed.): Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"1153_CR18","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1287\/moor.2016.0781","volume":"41","author":"S Y\u0131ld\u0131z","year":"2016","unstructured":"Y\u0131ld\u0131z, S., Cornu\u00e9jols, G.: Cut-generating functions for integer variables. Math. Oper. Res. 41, 1381\u20131403 (2016)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1153-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1153-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1153-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:22:52Z","timestamp":1589646172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1153-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,3]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1153"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1153-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,5,3]]},"assertion":[{"value":"30 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}