{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T01:36:16Z","timestamp":1772674576152,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319334608","type":"print"},{"value":"9783319334615","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_9","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T18:35:59Z","timestamp":1464114959000},"page":"102-113","source":"Crossref","is-referenced-by-count":29,"title":["Extended Formulations in Mixed-Integer Convex Programming"],"prefix":"10.1007","author":[{"given":"Miles","family":"Lubin","sequence":"first","affiliation":[]},{"given":"Emre","family":"Yamangil","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Bent","sequence":"additional","affiliation":[]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"9_CR1","unstructured":"MINLPLIB2 library. http:\/\/www.gamsworld.org\/minlp\/minlplib2\/html\/"},{"key":"9_CR2","doi-asserted-by":"crossref","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 J. Comput. 22, 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10107-011-0499-2","volume":"137","author":"A Ahmadi","year":"2013","unstructured":"Ahmadi, A., Olshevsky, A., Parrilo, P., Tsitsiklis, J.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137, 453\u2013476 (2013)","journal-title":"Math. Program."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-Integer nonlinear optimization. Acta Numerica 22, 1\u2013131 (2013)","journal-title":"Acta Numerica"},{"key":"9_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"9_CR7","doi-asserted-by":"crossref","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 Optim. 5, 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"9_CR8","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4614-1927-3_1","volume-title":"Mixed Integer Nonlinear Programming","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 1\u201339. Springer, New York (2012)"},{"key":"9_CR9","series-title":"Nonconvex Optimization and its Applications","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.: KNITRO: An integrated package for nonlinear optimization. In: di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization. Nonconvex Optimization and its Applications, vol. 83, pp. 35\u201359. Springer, Berlin (2006)"},{"key":"9_CR10","unstructured":"Diamond, S., Chu, E., Boyd, S.: Disciplined convex programming. http:\/\/dcp.stanford.edu\/"},{"key":"9_CR11","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4614-1927-3_2","volume-title":"Mixed Integer Nonlinear Programming","author":"S Drewes","year":"2012","unstructured":"Drewes, S., Ulbrich, S.: Subgradient based outer approximation for mixed integer second order cone programming. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 41\u201359. Springer, New York (2012)"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Program. 66, 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1137\/140958025","volume":"25","author":"N Goldberg","year":"2015","unstructured":"Goldberg, N., Leyffer, S.: An active-set method for second-order conic-constrained quadratic programming. SIAM J. Optim. 25, 1455\u20131477 (2015)","journal-title":"SIAM J. Optim."},{"key":"9_CR14","series-title":"Nonconvex Optimization and its Applica-tions","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization. Nonconvex Optimization and its Applica-tions, vol. 84, pp. 155\u2013210. Springer, US (2006)"},{"key":"9_CR15","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-1-4614-1927-3_3","volume-title":"Mixed Integer Nonlinear Programming","author":"O G\u00fcnl\u00fck","year":"2012","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulation and applications. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 61\u201389. Springer, New York (2012)"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Manag. Sci. 31, 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I Harjunkoski","year":"1998","unstructured":"Harjunkoski, I., Westerlund, T., P\u00f6rn, R., Skrifvars, H.: Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105, 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9_CR18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s00186-015-0514-0","volume":"83","author":"L Hien","year":"2015","unstructured":"Hien, L.: Differential properties of euclidean projection onto power cone. Math. Methods Oper. Res. 83(3), 265\u2013284 (2015)","journal-title":"Math. Methods Oper. Res."},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/ijoc.1120.0545","volume":"26","author":"H Hijazi","year":"2014","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J. Comput. 26, 31\u201344 (2014)","journal-title":"INFORMS J. Comput."},{"key":"9_CR20","unstructured":"K\u0131l\u0131n\u00e7, M.R.: Disjunctive cutting planes and algorithms for convex mixed integer nonlinear programming. Ph.D. thesis, University of Wisconsin-Madison (2011)"},{"key":"9_CR21","unstructured":"Leyffer, S.: Deterministic methods for mixed integer nonlinear programming. Ph.D. thesis, University of Dundee, December 1993"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998). International Linear Algebra Society (ILAS) Symposium on Fast Algorithms for Control, Signals and Image Processing","journal-title":"Linear Algebra Appl."},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin, M., Dunning, I.: Computing in operations research using Julia. INFORMS J. Comput. 27, 238\u2013248 (2015)","journal-title":"INFORMS J. Comput."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Lubin, M., Yamangil, E., Bent, R., Vielma, J.P.: Extended formulations in mixed-integer convex programming, ArXiv e-prints (2015)","DOI":"10.1007\/978-3-319-33461-5_9"},{"key":"9_CR25","unstructured":"Mittelmann, H.: MINLP benchmark. http:\/\/plato.asu.edu\/ftp\/minlp_old.html"},{"key":"9_CR26","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Operator splitting for conic optimization via homogeneous self-dual embedding, ArXiv e-prints (2013)"},{"key":"9_CR27","unstructured":"Serrano, S.A.: Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone. Ph.D. thesis, Stanford University, Stanford, CA, March 2015"},{"key":"9_CR28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Udell, M., Mohan, K., Zeng, D., Hong, J., Diamond, S., Boyd, S.: Convex optimization in Julia. In: Proceedings of HPTCDL 2014, Piscataway, NJ, USA, pp. 18\u201328. IEEE Press (2014)","DOI":"10.1109\/HPTCDL.2014.5"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Vielma, J.P., Dunning, I., Huchette, J., Lubin, M.: Extended formulations in mixed integer conic quadratic programming, ArXiv e-prints (2015)","DOI":"10.1007\/s12532-016-0113-y"}],"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-319-33461-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T15:46:28Z","timestamp":1567957588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}