{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:49:14Z","timestamp":1743014954734,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_5","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"52-64","source":"Crossref","is-referenced-by-count":15,"title":["Lift-and-Project Cuts for Mixed Integer Convex Programs"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Bonami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1287\/ijoc.1090.0373","volume":"22","author":"K. Abhishek","year":"2010","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs. INFORMS Journal on Computing\u00a022, 555\u2013567 (2010)","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR2","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":"5_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1988","unstructured":"Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics\u00a089, 3\u201344 (1988); (originaly MSRR # 348, Carnegie Mellon University, July 1974)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-009-0006-4","volume":"1","author":"E. Balas","year":"2009","unstructured":"Balas, E., Bonami, P.: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Mathematical Programming Computations\u00a01, 165\u2013199 (2009)","journal-title":"Mathematical Programming Computations"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming\u00a058, 295\u2013324 (1993)","journal-title":"Math. Programming"},{"key":"5_CR6","doi-asserted-by":"publisher","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. Operations Research Letters\u00a019, 1\u20139 (1996)","journal-title":"Operations Research Letters"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E. Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. European J. Oper. Res.\u00a04(4), 224\u2013234 (1980)","journal-title":"European J. Oper. Res."},{"issue":"1-3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E. Balas","year":"2002","unstructured":"Balas, E., Perregaard, M.: Lift and project for mixed 0-1 programming: Recent progress. Discrete Applied Mathematics\u00a0123(1-3), 129\u2013154 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"2-3, Ser. B","key":"5_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Program\u00a094(2-3, Ser. B), 221\u2013245 (2003); The Aussois 2000 Workshop in Combinatorial Optimization","journal-title":"Math. Program"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics\u00a034, 119\u2013148 (1978)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"5_CR11","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Research Report HAL, CNRS (October 2010), \n                  \n                    http:\/\/hal.archives-ouvertes.fr\/hal-00529816\/en\/"},{"issue":"2","key":"5_CR12","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., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization\u00a05(2), 186\u2013204 (2008)","journal-title":"Discrete Optimization"},{"key":"5_CR13","unstructured":"Bonami, P., Forrest, J.J.H., Laird, C., Lee, J., Margot, F., W\u00e4chter, A.: Bonmin: Basic Open-source Nonlinear Mixed INteger programming (July 2006), \n                  \n                    http:\/\/www.coin-or.org\/Bonmin"},{"key":"5_CR14","unstructured":"Bonami, P., K\u0131l\u0131n\u00e7, M., Linderoth, J.: Algorithms and Software for Convex Mixed Integer Nonlinear Programs. Technical report, Technical Report #1664, Computer Sciences Department, University of Wisconsin-Madison (2009)"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"P. Bonami","year":"2005","unstructured":"Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0\u20131 MIPs, a computational investigation. Discrete Optimization\u00a02(4), 288\u2013307 (2005)","journal-title":"Discrete Optimization"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib \u2013 A collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing\u00a015(1) (2003)","DOI":"10.1287\/ijoc.15.1.114.15159"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive optimization. Mathematical Programming\u00a086, 595\u2013614 (1999)","journal-title":"Mathematical Programming"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M.T. Cezik","year":"2005","unstructured":"Cezik, M.T., Iyengar, G.: Cuts for mixed 0-1 conic programming. Mathematical Programming\u00a0104, 179\u2013202 (2005)","journal-title":"Mathematical Programming"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Mathematical Programming (2009), doi: 10.1007\/s10107-009-0300-y (in press)","DOI":"10.1007\/s10107-009-0300-y"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-13520-0_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M. Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D.: An in-out approach to disjunctive optimization. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 136\u2013140. Springer, Heidelberg (2010)"},{"key":"5_CR21","unstructured":"Fletcher, R., Leyffer, S.: User manual for filterSQP, University of Dundee Numerical Analysis Report NA-181 (1998)"},{"key":"5_CR22","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solution 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":"5_CR23","unstructured":"K\u0131l\u0131n\u00e7, M., Linderoth, J., Luedtke, J.: Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Technical Report Computer Sciences Department, University of Wisconsin-Madison (2010)"},{"key":"5_CR24","unstructured":"Leyffer, S.: MacMINLP: Test problems for mixed integer nonlinear programming (2003), \n                  \n                    http:\/\/www.mcs.anl.gov\/~leyffer\/macminlp"},{"key":"5_CR25","unstructured":"Linderoth, J., K\u0131l\u0131n\u00e7, M.: Personnal communication (2010)"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R. Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R.: The common optimization interface for operations research. IBM Journal of Research and Development\u00a047, 57\u201366 (2003), \n                  \n                    http:\/\/www.coin-or.org","journal-title":"IBM Journal of Research and Development"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Operations Research\u00a049(3), 363\u2013371 (2001)","journal-title":"Operations Research"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12532-009-0003-7","volume":"1","author":"F. Margot","year":"2009","unstructured":"Margot, F.: Testing cut generators for mixed integer linear programming. Mathematical Programming Computation\u00a01, 69\u201395 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"5_CR29","unstructured":"Perregaard, M.: Generative Disjunctive Cuts for Mixed Integer Programs. PhD thesis, Carnegie Mellon University (2003)"},{"key":"5_CR30","unstructured":"Sawaya, N., Laird, C.D., Biegler, L.T., Bonami, P., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Lee, J., Lodi, A., Margot, F., W\u00e4chter, A.: CMU-IBM open source MINLP project test set (2006), \n                  \n                    http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. Stubbs","year":"1999","unstructured":"Stubbs, R., Mehrotra, S.: A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming\u00a086, 515\u2013532 (1999)","journal-title":"Mathematical Programming"},{"key":"5_CR32","unstructured":"W\u00e4chter, A., Laird, C.D., Kawajir, Y.: Introduction to IPOPT: A tutorial for downloading, installing, and using IPOPT (2010), \n                  \n                    http:\/\/www.coin-or.org\/Ipopt\/documentation\/"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:13:46Z","timestamp":1558296826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}