{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:44:18Z","timestamp":1776105858617,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T00:00:00Z","timestamp":1478563200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s12532-016-0113-y","type":"journal-article","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T09:52:39Z","timestamp":1478598759000},"page":"369-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Extended formulations in mixed integer conic quadratic programming"],"prefix":"10.1007","volume":"9","author":[{"given":"Juan Pablo","family":"Vielma","sequence":"first","affiliation":[]},{"given":"Iain","family":"Dunning","sequence":"additional","affiliation":[]},{"given":"Joey","family":"Huchette","sequence":"additional","affiliation":[]},{"given":"Miles","family":"Lubin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,8]]},"reference":[{"key":"113_CR1","unstructured":"Julia interface for the CPLEX optimization software. https:\/\/github.com\/JuliaOpt\/CPLEX.jl"},{"key":"113_CR2","unstructured":"JuMP Modeling language for Mathematical Programming. https:\/\/github.com\/JuliaOpt\/JuMP.jl"},{"issue":"4","key":"113_CR3","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(4), 555\u2013567 (2010)","journal-title":"INFORMS J. Comput."},{"key":"113_CR4","first-page":"1","volume-title":"Flavors of Geometry, Mathematical Sciences Research Institute Publications","author":"KM Ball","year":"1997","unstructured":"Ball, K.M.: An elementary introduction to modern convex geometry. In: Levy, S. (ed.) Flavors of Geometry, Mathematical Sciences Research Institute Publications, vol. 31, pp. 1\u201358. Cambridge University Press, Cambridge (1997)"},{"key":"113_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, And Engineering Applications, vol.\u00a02. SIAM, Philadelphia (2001)","DOI":"10.1137\/1.9780898718829"},{"issue":"2","key":"113_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26(2), 193\u2013205 (2001)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"113_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43(1), 1\u201322 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"113_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74(2), 121\u2013140 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"113_CR9","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., et al.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"113_CR10","doi-asserted-by":"crossref","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Mixed Integer Nonlinear Programming, pp. 1\u201339. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-1927-3_1"},{"issue":"4","key":"113_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21(4), 359\u2013367 (1994)","journal-title":"Comput. Oper. Res."},{"key":"113_CR12","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Programm. 86, 595\u2013614 (1999)","journal-title":"Math. Programm."},{"issue":"2","key":"113_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1057\/palgrave.jam.2240207","volume":"7","author":"S Ceria","year":"2006","unstructured":"Ceria, S., Stubbs, R.A.: Incorporating estimation errors into portfolio selection: robust portfolio construction. J. Asset Manag. 7(2), 109\u2013127 (2006)","journal-title":"J. Asset Manag."},{"key":"113_CR14","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","volume":"27","author":"TJ Chang","year":"2000","unstructured":"Chang, T.J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27, 1271\u20131302 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"113_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"113_CR16","doi-asserted-by":"crossref","unstructured":"Dong, H., Linderoth, J.: On valid inequalities for quadratic programming with continuous variables and binary indicators. In: Goemans, M.X., Correa J.R. (eds.) Integer Programming and Combinatorial Optimization\u201416th International Conference, IPCO 2013, Valpara\u00edso, Chile, March 18\u201320, 2013. Proceedings, Lecture Notes in Computer Science, vol. 7801, pp. 169\u2013180. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_15"},{"issue":"3","key":"113_CR17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36(3), 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"113_CR18","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(3), 327\u2013349 (1994)","journal-title":"Math. Program."},{"key":"113_CR19","doi-asserted-by":"crossref","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\u20131 mixed integer programs. Math. Programm. 106, 225\u2013236 (2006)","journal-title":"Math. Programm."},{"key":"113_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.orl.2006.03.008","volume":"35","author":"A Frangioni","year":"2007","unstructured":"Frangioni, A., Gentile, C.: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35, 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"key":"113_CR21","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.orl.2009.02.003","volume":"37","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C.: A computational comparison of reformulations of the perspective relaxation: Socp vs. cutting planes. Oper. Res. Lett. 37, 206\u2013210 (2009)","journal-title":"Oper. Res. Lett."},{"key":"113_CR22","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1287\/opre.1110.0930","volume":"59","author":"A Frangioni","year":"2011","unstructured":"Frangioni, A., Gentile, C., Grande, E., Pacifici, A.: Projected perspective reformulations with applications in design problems. Oper. Res. 59, 1225\u20131232 (2011)","journal-title":"Oper. Res."},{"issue":"4","key":"113_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A Geoffrion","year":"1972","unstructured":"Geoffrion, A.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"113_CR24","unstructured":"Glineur, F.: Computational experiments with a linear approximation of second order cone optimization. Image Technical Report 0001, Service de Math\u00e9matique et de Recherche Op\u00e9rationnelle, Facult\u00e9 Polytechnique de Mons, Mons, Belgium (2000)"},{"key":"113_CR25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"IE Grossmann","year":"2003","unstructured":"Grossmann, I.E., Lee, S.: Generalized convex disjunctive programming: nonlinear convex hull relaxation. Comput. Optim. Appl. 26, 83\u2013100 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"113_CR26","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. In: Lodi, A., Panconesi, A., Rinaldi G. (eds.) Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26\u201328, 2008, Proceedings, Lecture Notes in Computer Science, vol. 5035, pp. 1\u201316. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-68891-4_1"},{"key":"113_CR27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"113_CR28","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-1-4614-1927-3_3"},{"issue":"12","key":"113_CR29","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(12), 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"key":"113_CR30","unstructured":"Gurobi Optimization: The Gurobi Optimizer. http:\/\/www.gurobi.com"},{"key":"113_CR31","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring on\/off constraints. Comput. Optim. Appl. 52, 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"113_CR32","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/ijoc.1120.0545","volume":"26","author":"H Hijazi","year":"2013","unstructured":"Hijazi, H., Bonami, P., Ouorou, A.: An outer-inner approximation for separable mixed-integer nonlinear programs. INFORMS J. Comput. 26(1), 31\u201344 (2013)","journal-title":"INFORMS J. Comput."},{"key":"113_CR33","unstructured":"IBM Corp.: User\u2019s Manual for CPLEX. IBM Corp (2014)"},{"key":"113_CR34","unstructured":"IBM ILOG: CPLEX High-performance mathematical programming engine. http:\/\/www.ibm.com\/software\/integration\/optimization\/cplex\/"},{"key":"113_CR35","unstructured":"Jeon, H., Linderoth, J., Miller, A.: Quadratic cone cutting surfaces for quadratic programs with on-off constraints. Optim. Online (2015). http:\/\/www.optimization-online.org\/DB_HTML\/2015\/01\/4746.html"},{"key":"113_CR36","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"113_CR37","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10479-006-0145-1","volume":"152","author":"MS Lobo","year":"2007","unstructured":"Lobo, M.S., Fazel, M., Boyd, S.: Portfolio optimization with linear and fixed transaction costs. Ann. Oper. Res. 152(1), 341\u2013365 (2007)","journal-title":"Ann. Oper. Res."},{"key":"113_CR38","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.: Application of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"113_CR39","unstructured":"Lubin, M., Dunning, I.: Computing in operations research using julia. arXiv preprint (2013). arXiv:1312.1431"},{"issue":"4","key":"113_CR40","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s00291-003-0139-1","volume":"25","author":"D Maringer","year":"2003","unstructured":"Maringer, D., Kellerer, H.: Optimization of cardinality constrained portfolios with a hybrid local search algorithm. OR Spectrum 25(4), 481\u2013495 (2003)","journal-title":"OR Spectrum"},{"key":"113_CR41","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"113_CR42","unstructured":"Stubbs, R.A.: Branch-and-cut methods for mixed 0\u20131 convex programming. Ph.D. thesis (1996)"},{"issue":"3","key":"113_CR43","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999)","journal-title":"Math. Program."},{"issue":"2","key":"113_CR44","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. Programm. 103(2), 225\u2013249 (2005)","journal-title":"Math. Programm."},{"key":"113_CR45","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs. INFORMS J. Comput. 20, 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."},{"key":"113_CR46","doi-asserted-by":"crossref","first-page":"S131","DOI":"10.1016\/0098-1354(95)00164-W","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex minlp problems. Comput. Chem. Eng. 19, S131\u2013S136 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"113_CR47","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/0098-1354(94)E0006-9","volume":"18","author":"T Westerlund","year":"1994","unstructured":"Westerlund, T., Pettersson, F., Grossmann, I.: Optimization of pump configurations as a minlp problem. Comput. Chem. Eng. 18(9), 845\u2013858 (1994)","journal-title":"Comput. Chem. Eng."},{"key":"113_CR48","unstructured":"Wolfram Research Inc.: Mathematica, Version 10.0. Wolfram Research, Inc., Champaign, Illinois (2014)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-016-0113-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0113-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-016-0113-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T10:53:22Z","timestamp":1568544802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-016-0113-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,8]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s12532-016-0113-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,8]]}}}