{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:57:18Z","timestamp":1725479838816},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_11","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"123-132","source":"Crossref","is-referenced-by-count":3,"title":["Cut-Generating Functions"],"prefix":"10.1007","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Daniilidis","sequence":"additional","affiliation":[]},{"given":"Claude","family":"Lemar\u00e9chal","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Cutting Planes from Two Rows of a Simplex Tableau. In: Proceedings of IPCO XII, Ithaca, New York, pp. 1\u201315 (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"key":"11_CR2","first-page":"427","volume":"18","author":"A. Basu","year":"2011","unstructured":"Basu, A., Cornu\u00e9jols, G., Zambelli, G.: Convex Sets and Minimal Sublinear Functions. Journal of Convex Analysis\u00a018, 427\u2013432 (2011)","journal-title":"Journal of Convex Analysis"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/090756375","volume":"24","author":"A. Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM Journal on Discrete Mathematics\u00a024, 158\u2013168 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Daniilidis, A., Lemar\u00e9chal, C., Malick, J.: Cut-Generating Functions and S-free Sets (submitted for publication, 2013)","DOI":"10.1007\/978-3-642-36694-9_11"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"2890","DOI":"10.1137\/090754388","volume":"20","author":"S.S. Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained Infinite Group Relaxations of MIPs. SIAM Journal on Optimization\u00a020, 2890\u20132912 (2010)","journal-title":"SIAM Journal on Optimization"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.G. Gomory","year":"1969","unstructured":"Gomory, R.G.: Some Polyhedra Related to Combinatorial Problems. Linear Algebra and Applications\u00a02, 451\u2013558 (1969)","journal-title":"Linear Algebra and Applications"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0120925","volume":"14","author":"E.L. Johnson","year":"1981","unstructured":"Johnson, E.L.: Characterization of Facets for Multiple Right-Hand Side Choice Linear Programs. Mathematical Programming Study\u00a014, 112\u2013142 (1981)","journal-title":"Mathematical Programming Study"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer (1993)","DOI":"10.1007\/978-3-662-06409-2"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer (2001)","DOI":"10.1007\/978-3-642-56468-0"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:49:28Z","timestamp":1557582568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}