{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:26:17Z","timestamp":1725557177440},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130359"},{"type":"electronic","value":"9783642130366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13036-6_25","type":"book-chapter","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:36:09Z","timestamp":1276000569000},"page":"327-340","source":"Crossref","is-referenced-by-count":10,"title":["The Chv\u00e1tal-Gomory Closure of an Ellipsoid Is a Polyhedron"],"prefix":"10.1007","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.T.: FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs. In: Preprint ANL\/MCS-P1374-0906, Argonne National Laboratory, Mathematics and Computer Science Division, Argonne, IL (September 2006)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K. Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. Mathematical Programming\u00a0102, 457\u2013493 (2005)","journal-title":"Mathematical Programming"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Cuts for conic mixed-integer programming. In: Fischetti and Williamson [24], pp. 16\u201329","DOI":"10.1007\/978-3-540-72792-7_2"},{"key":"25_CR4","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Lifting for conic mixed-integer programming. Research Report BCOL.07.04, IEOR, University of California-Berkeley, October 2007, Forthcoming in Mathematical Programming (2007)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.disopt.2009.03.002","volume":"6","author":"A. Atamt\u00fcrk","year":"2009","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: The submodular 0-1 knapsack polytope. Discrete Optimization\u00a06, 333\u2013344 (2009)","journal-title":"Discrete Optimization"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-008-0239-4","volume":"122","author":"A. Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Mathematical Programming\u00a0122, 1\u201320 (2010)","journal-title":"Mathematical Programming"},{"key":"25_CR7","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0113, 219\u2013240 (2008)","journal-title":"Mathematical Programming"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P. Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., Waechter, A.: Branching and bound tightening techniques for non-convex MINLP. Optimization Methods and Software\u00a024, 597\u2013634 (2009)","journal-title":"Optimization Methods and Software"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Waechter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization\u00a05, 186\u2013204 (2008)","journal-title":"Discrete Optimization"},{"key":"25_CR10","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs, Technical Report 1664, Computer Sciences Department, University of Wisconsin-Madison (October 2009)"},{"key":"25_CR11","first-page":"221","volume":"74","author":"A. Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $\\{0,\\frac{1}{2}\\}$ -Chv\u00e1tal-Gomory cuts. Mathematical Programming\u00a074, 221\u2013235 (1996)","journal-title":"Mathematical Programming"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Letchford, A.N.: On the separation of split cuts and related inequalities. Mathematical Programming\u00a094, 279\u2013294 (2003)","journal-title":"Mathematical Programming"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Perspective cuts for a class of convex 0-1 mixed integer programs. Mathematical Programming\u00a086, 595\u2013614 (1999)","journal-title":"Mathematical Programming"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M.T. \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M.T., Iyengar, G.: Cuts for mixed 0-1 conic programming. Mathematical Programming\u00a0104, 179\u2013202 (2005)","journal-title":"Mathematical Programming"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chvatal","year":"1973","unstructured":"Chvatal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Mathematics"},{"key":"25_CR16","volume-title":"Combinatorial optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial optimization. John Wiley and Sons, Inc., Chichester (1998)"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"58","author":"W.J. Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming\u00a058, 155\u2013174 (1990)","journal-title":"Mathematical Programming"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory closure of strictly convex sets. Working paper, Geogia Institute of Technology (2010)","DOI":"10.1007\/978-3-642-20807-2_11"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A.: On the MIR closure of polyhedra. In: Fischetti and Williamson [24], pp. 337\u2013351","DOI":"10.1007\/978-3-540-72792-7_26"},{"key":"25_CR20","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0121, 33\u201360 (2010)","journal-title":"Mathematical Programming"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica\u00a019, 297\u2013300 (1999)","journal-title":"Combinatorica"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/11496915_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e0tal closure. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 12\u201322. Springer, Heidelberg (2005)"},{"key":"25_CR23","doi-asserted-by":"publisher","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. Mathematical Programming, Series B\u00a0110, 3\u201320 (2007)","journal-title":"Mathematical Programming, Series B"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Integer programming and combinatorial optimization, 12th international ipco conference","year":"2007","unstructured":"Fischetti, M., Williamson, D.P. (eds.): IPCO 2007. LNCS, vol.\u00a04513. Springer, Heidelberg (2007)"},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A. Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0-1 mixed integer programs. Mathematical Programming\u00a0106, 225\u2013236 (2006)","journal-title":"Mathematical Programming"},{"key":"25_CR26","doi-asserted-by":"publisher","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. Bulletin of the American Mathematical Society\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"25_CR27","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: Recent advances in mathematical programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"I. Grossmann","year":"2003","unstructured":"Grossmann, I., Lee, S.: Generalized convex disjunctive programming: Nonlinear convex hull relaxation. Computational Optimization and Applications\u00a026, 83\u2013100 (2003)","journal-title":"Computational Optimization and Applications"},{"key":"25_CR29","unstructured":"G\u00fcnl\u00fck, O., Lee, J., Weismantel, R.: MINLP strengthening for separable convex quadratic transportation-cost UFL, IBM Research Report RC24213, IBM, Yorktown Heights, NY (March 2007)"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. In: Lodi, et al. (eds.) [38], pp. 1\u201316","DOI":"10.1007\/978-3-540-68891-4_1"},{"key":"25_CR31","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. Mathematical Programming, Series B (to appear 2009)"},{"key":"#cr-split#-25_CR32.1","unstructured":"Hemmecke, R., K??ppe, M., Lee, J., Weismantel, R.: Nonlinear integer programming. IBM Research Report RC24820, IBM, Yorktown Heights, NY (December 2008);"},{"key":"#cr-split#-25_CR32.2","doi-asserted-by":"crossref","unstructured":"Juenger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L.: 50 Years of Integer Programming 1958???2008: The Early Years and State-of-the-Art Surveys. Springer, Heidelberg (to appear 2010), ISBN 3540682740.","DOI":"10.1007\/978-3-540-68279-0"},{"key":"25_CR33","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1287\/opre.21.1.221","volume":"21","author":"R. Jeroslow","year":"1973","unstructured":"Jeroslow, R.: There cannot be any algorithm for integer programming with quadratic constraints. Operations Research\u00a021, 221\u2013224 (1973)","journal-title":"Operations Research"},{"key":"25_CR34","unstructured":"Letchford, A.N., Pokutta, S., Schulz, A.S.: On the membership problem for the {0, 1\/2}-closure. Working paper, Lancaster University (2009)"},{"key":"25_CR35","doi-asserted-by":"crossref","unstructured":"Letchford, A.N., S\u00f8rensen, M.M.: Binary positive semidefinite matrices and associated integer polytopes. In: Lodi, et al. (eds.) [38], pp. 125\u2013139","DOI":"10.1007\/978-3-540-68891-4_9"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Leyffer, S., Linderoth, J.T., Luedtke, J., Miller, A., Munson, T.: Applications and algorithms for mixed integer nonlinear programming. Journal of Physics: Conference Series\u00a0180 (2009)","DOI":"10.1088\/1742-6596\/180\/1\/012014"},{"key":"25_CR37","unstructured":"Leyffer, S., Sartenaer, A., Wanufelle, E.: Branch-and-refine for mixed-integer nonconvex global optimization. In: Preprint ANL\/MCS-P1547-0908, Argonne National Laboratory, Mathematics and Computer Science Division, Argonne, IL (September 2008)"},{"key":"25_CR38","series-title":"Lecture Notes in Computer Science","volume-title":"Integer Programming and Combinatorial Optimization","year":"2008","unstructured":"Lodi, A., Panconesi, A., Rinaldi, G. (eds.): IPCO 2008. LNCS, vol.\u00a05035. Springer, Heidelberg (2008)"},{"key":"25_CR39","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10107-008-0226-9","volume":"121","author":"J.-P.P. Richard","year":"2010","unstructured":"Richard, J.-P.P., Tawarmalani, M.: Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Mathematical Programming\u00a0121, 61\u2013104 (2010)","journal-title":"Mathematical Programming"},{"key":"25_CR40","doi-asserted-by":"crossref","unstructured":"Saxena, A., Bonami, P., Lee, J.: Disjunctive cuts for non-convex mixed integer quadratically constrained programs. In: Lodi, et al. (eds.) [38], pp. 17\u201333","DOI":"10.1007\/978-3-540-68891-4_2"},{"key":"#cr-split#-25_CR41.1","doi-asserted-by":"crossref","unstructured":"Schrijver, A.: On cutting planes. Annals of Discrete Mathematics??9, 291???296 (1980);","DOI":"10.1016\/S0167-5060(08)70085-2"},{"key":"#cr-split#-25_CR41.2","unstructured":"Combinatorics 79 (Proc. Colloq., Univ. Montr??al, Montreal, Que., 1979), Part II (1979)"},{"key":"25_CR42","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., New York (1986)"},{"key":"25_CR43","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R.A. Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming\u00a086, 515\u2013532 (1999)","journal-title":"Mathematical Programming"},{"key":"25_CR44","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.orl.2005.12.005","volume":"35","author":"J.P. Vielma","year":"2007","unstructured":"Vielma, J.P.: A constructive characterization of the split closure of a mixed integer linear program. Operations Research Letters\u00a035, 29\u201335 (2007)","journal-title":"Operations Research Letters"}],"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-13036-6_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:21Z","timestamp":1606186821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13036-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130359","9783642130366"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13036-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}