{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:02:24Z","timestamp":1774947744018,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-21-0107"],"award-info":[{"award-number":["FA9550-21-0107"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-20-1-2156"],"award-info":[{"award-number":["N00014-20-1-2156"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10898-022-01184-6","type":"journal-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T04:02:56Z","timestamp":1655092976000},"page":"869-912","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Compact mixed-integer programming formulations in quadratic optimization"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2188-8793","authenticated-orcid":false,"given":"Benjamin","family":"Beach","sequence":"first","affiliation":[]},{"given":"Robert","family":"Hildebrand","sequence":"additional","affiliation":[]},{"given":"Joey","family":"Huchette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"issue":"9","key":"1184_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, $$\\alpha $$bb, for general twice-differentiable constrained NLPs\u2013II. Implementation and computational results. Comput. Chem. Eng. 22(9), 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"1184_CR2","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha $$BB, for general twice-differentiable constrained NLPs\u2013I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"1184_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, R., Huchette, J., Tjandraatmadja, C., Vielma, J.P.: Strong mixed-integer programming formulations for trained neural networks. In: A.\u00a0Lodi, V.\u00a0Nagarajan (eds.) Proceedings of the 20th Conference on Integer Programming and Combinatorial Optimization, pp. 27\u201342. Springer International Publishing, Cham (2019). arXiv:1811.08359","DOI":"10.1007\/978-3-030-17953-3_3"},{"key":"1184_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-17953-3_3","volume-title":"Integer Programming and Combinatorial Optimization","author":"R Anderson","year":"2019","unstructured":"Anderson, R., Huchette, J., Tjandraatmadja, C., Vielma, J.P.: Strong mixed-integer programming formulations for trained neural networks. In: Lodi, A., Nagarajan, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 27\u201342. Springer International Publishing, Cham (2019)"},{"issue":"4","key":"1184_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"I Androulakis","year":"1995","unstructured":"Androulakis, I., Maranas, C.D.: $$\\alpha $$BB: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1184_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha $$bb: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1184_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10107-017-1147-2","volume":"169","author":"J Bader","year":"2018","unstructured":"Bader, J., Hildebrand, R., Weismantel, R., Zenklusen, R.: Mixed integer reformulations of integer programs and the affine tu-dimension of a matrix. Math. Program. 169(2), 565\u2013584 (2018)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1184_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Extending the QCR method to general mixed-integer programs. Math. Program. 131(1\u20132), 381\u2013401 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0381-7","journal-title":"Math. Program."},{"issue":"1","key":"1184_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-015-0921-2","volume":"158","author":"A Billionnet","year":"2016","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1), 235\u2013266 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0921-2","journal-title":"Math. Program."},{"issue":"3","key":"1184_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-018-0133-x","volume":"10","author":"P Bonami","year":"2018","unstructured":"Bonami, P., G\u00fcnl\u00fck, O., Linderoth, J.: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10(3), 333\u2013382 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0133-x","journal-title":"Math. Program. Comput."},{"key":"1184_CR11","unstructured":"Bunel, R., Lu, J., Turkaslan, I., Torr, P.H., Kohli, P., Kumar, M.P.: Branch and bound for piecewise linear neural network verification (2019). arXiv:1909.06588"},{"key":"1184_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-1-4614-1927-3_13","volume-title":"Mixed Integer Nonlinear Programming","author":"S Burer","year":"2012","unstructured":"Burer, S., Saxena, A.: The MILP road to MIQCP. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 373\u2013405. Springer, New York (2012)"},{"issue":"4","key":"1184_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s10898-018-0612-7","volume":"71","author":"PAC Castillo","year":"2018","unstructured":"Castillo, P.A.C., Castro, P.M., Mahalec, V.: Global optimization of MIQCPs with dynamic piecewise relaxations. J. Glob. Optim. 71(4), 691\u2013716 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0612-7","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1184_CR14","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s10898-015-0342-z","volume":"64","author":"PM Castro","year":"2015","unstructured":"Castro, P.M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems. J. Glob. Optim. 64(4), 765\u2013784 (2015)","journal-title":"J. Glob. Optim."},{"key":"1184_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.compchemeng.2014.03.025","volume":"72","author":"PM Castro","year":"2015","unstructured":"Castro, P.M.: Tightening piecewise McCormick relaxations for bilinear problems. Comput. Chem. Eng. 72, 300\u2013311 (2015). https:\/\/doi.org\/10.1016\/j.compchemeng.2014.03.025","journal-title":"Comput. Chem. Eng."},{"key":"1184_CR16","doi-asserted-by":"publisher","unstructured":"Castro, P.M., Liao, Q., Liang, Y.: Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems. Optim. Eng. (2021). https:\/\/doi.org\/10.1007\/s11081-021-09603-5","DOI":"10.1007\/s11081-021-09603-5"},{"issue":"1","key":"1184_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"9","key":"1184_CR18","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1287\/mnsc.49.9.1268.16570","volume":"49","author":"KL Croxton","year":"2003","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Manag. Sci. 49(9), 1268\u20131273 (2003)","journal-title":"Manag. Sci."},{"key":"1184_CR19","doi-asserted-by":"crossref","unstructured":"Dantzig, G.B.: On the significance of solving linear programming problems with some integer variables. Econometrica J. Econom. Soc. 30\u201344 (1960)","DOI":"10.2307\/1905292"},{"issue":"2","key":"1184_CR20","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1287\/opre.2015.1357","volume":"63","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Gupte, A.: Analysis of milp techniques for the pooling problem. Oper. Res. 63(2), 412\u2013427 (2015)","journal-title":"Oper. Res."},{"key":"1184_CR21","unstructured":"Dey, S.S., Kazachkov, A.M., Lodi, A., Mu, G.: Cutting plane generation through sparse principal component analysis. http:\/\/www.optimization-online.org\/DB_HTML\/2021\/02\/8259.html"},{"issue":"3","key":"1184_CR22","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1137\/140960657","volume":"26","author":"H Dong","year":"2016","unstructured":"Dong, H.: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations. SIAM J. Optim. 26(3), 1962\u20131985 (2016)","journal-title":"SIAM J. Optim."},{"key":"1184_CR23","unstructured":"Dong, H., Luo, Y.: Compact disjunctive approximations to nonconvex quadratically constrained programs (2018)"},{"issue":"2","key":"1184_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"1","key":"1184_CR25","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1080\/10556788.2017.1350675","volume":"34","author":"S Elloumi","year":"2019","unstructured":"Elloumi, S., Lambert, A.: Global solution of non-convex quadratically constrained quadratic programs. Optim. Methods Software 34(1), 98\u2013114 (2019). https:\/\/doi.org\/10.1080\/10556788.2017.1350675","journal-title":"Optim. Methods Software"},{"issue":"2","key":"1184_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/bf03006558","volume":"11","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: L\u2019algebre de boole et ses applications en recherche operationnelle. Trabajos de Estadistica 11(2), 111\u2013118 (1960). https:\/\/doi.org\/10.1007\/bf03006558","journal-title":"Trabajos de Estadistica"},{"key":"1184_CR27","doi-asserted-by":"publisher","unstructured":"Foss, F.A.: The use of a reflected code in digital control systems. Transactions of the I.R.E. Professional Group on Electronic Computers EC-3(4), 1\u20136 (1954). https:\/\/doi.org\/10.1109\/irepgelc.1954.6499244","DOI":"10.1109\/irepgelc.1954.6499244"},{"key":"1184_CR28","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\u20131 mixed integer programs. Math. Program. Ser. A 106, 225\u2013236 (2006)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"1184_CR29","doi-asserted-by":"publisher","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(2), 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1184_CR30","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N.V., Vigerske, S., Wiegele, A.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2), 237\u2013265 (2019)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1184_CR31","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1007\/s11590-013-0676-8","volume":"8","author":"L Galli","year":"2014","unstructured":"Galli, L., Letchford, A.N.: A compact variant of the qcr method for quadratically constrained quadratic 0\u20131 programs. Optim. Lett. 8(4), 1213\u20131224 (2014). https:\/\/doi.org\/10.1007\/s11590-013-0676-8","journal-title":"Optim. Lett."},{"issue":"5","key":"1184_CR32","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.orl.2018.08.005","volume":"46","author":"L Galli","year":"2018","unstructured":"Galli, L., Letchford, A.N.: A binarisation heuristic for non-convex quadratic programming with box constraints. Oper. Res. Lett. 46(5), 529\u2013533 (2018). https:\/\/doi.org\/10.1016\/j.orl.2018.08.005","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1184_CR33","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 455\u2013460 (1975). https:\/\/doi.org\/10.1287\/mnsc.22.4.455","journal-title":"Manag. Sci."},{"issue":"3","key":"1184_CR34","first-page":"67","volume":"4","author":"P Hammer","year":"1970","unstructured":"Hammer, P., Ruben, A.: Some remarks on quadratic programming with 0\u20131 variables. Revue Francaise D Automatique Informatique Recherche Operationnelle 4(3), 67\u201379 (1970)","journal-title":"Revue Francaise D Automatique Informatique Recherche Operationnelle"},{"issue":"3","key":"1184_CR35","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Ruiz, M., Xiong, J.: Global minimization of indefinite quadratic functions subject to box constraints. Naval Res. Logist. (NRL) 40(3), 373\u2013392 (1993). https:\/\/doi.org\/10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","journal-title":"Naval Res. Logist. (NRL)"},{"key":"1184_CR36","unstructured":"Huchette, J., Vielma, J.P.: Nonconvex piecewise linear functions: Advanced formulations and simple modeling tools. Oper. Res. (to appear). arXiv:1708.00050"},{"key":"1184_CR37","unstructured":"Huchette, J.A.: Advanced mixed-integer programming formulations : methodology, computation, and application. Ph.D. thesis, Massachusetts Institute of Technology (2018)"},{"key":"1184_CR38","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pashkovich, K.: Constructing Extended Formulations from Reflection Relations, pp. 77\u2013100. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38189-8_4"},{"key":"1184_CR39","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0166-218X(00)00216-X","volume":"108","author":"J Lee","year":"2001","unstructured":"Lee, J., Wilson, D.: Polyhedral methods for piecewise-linear functions I: the lambda method. Discrete Appl. Math. 108, 269\u2013285 (2001)","journal-title":"Discrete Appl. Math."},{"key":"1184_CR40","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Stratila, D.: Separable concave optimization approximately equals piecewise linear optimization. In: D.\u00a0Bienstock, G.\u00a0Nemhauser (eds.) Lecture Notes in Computer Science, vol. 3064, pp. 234\u2013243. Springer (2004)","DOI":"10.1007\/978-3-540-25960-2_18"},{"issue":"1","key":"1184_CR41","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-012-0555-6","volume":"136","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. 136(1), 155\u2013182 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0555-6","journal-title":"Math. Program."},{"key":"1184_CR42","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10898-018-00734-1","volume":"74","author":"H Nagarajan","year":"2019","unstructured":"Nagarajan, H., Lu, M., Wang, S., Bent, R., Sundar, K.: An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. J. Glob. Optim. 74, 639\u2013675 (2019)","journal-title":"J. Glob. Optim."},{"key":"1184_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00028-6","volume":"27","author":"M Padberg","year":"2000","unstructured":"Padberg, M.: Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27, 1\u20135 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1184_CR44","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P Pardalos","year":"1991","unstructured":"Pardalos, P., Vavasis, S.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1184_CR45","first-page":"105","volume":"26","author":"E Phan-huy-Hao","year":"1982","unstructured":"Phan-huy-Hao, E.: Quadratically constrained quadratic programming: some applications and a method for solution. Zeitschrift f\u00fcr Oper. Res. 26(1), 105\u2013119 (1982)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"4","key":"1184_CR46","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"1184_CR47","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2011","unstructured":"Saxena, A., Bomani, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations. Math. Program. 130, 359\u2013413 (2011)","journal-title":"Math. Program."},{"key":"1184_CR48","unstructured":"Serra, T., Ramalingam, S.: Empirical bounds on linear regions of deep rectifier networks (2018). arXiv:1810.03370"},{"key":"1184_CR49","unstructured":"Serra, T., Tjandraatmadja, C., Ramalingam, S.: Bounding and counting linear regions of deep neural networks. In: Thirty-fifth International Conference on Machine Learning (2018)"},{"key":"1184_CR50","unstructured":"Tjeng, V., Xiao, K., Tedrake, R.: Verifying neural networks with mixed integer programming. In: International Conference on Learning Representations (2019)"},{"issue":"2","key":"1184_CR51","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"1184_CR52","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010). https:\/\/doi.org\/10.1287\/opre.1090.0721","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"1184_CR53","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2009","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1\u20132), 49\u201372 (2009). https:\/\/doi.org\/10.1007\/s10107-009-0295-4","journal-title":"Math. Program."},{"issue":"6","key":"1184_CR54","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/s0898-1221(99)00075-9","volume":"37","author":"Y Wei","year":"1999","unstructured":"Wei, Y.: Triangular function analysis. Comput. Math. Appl. 37(6), 37\u201356 (1999). https:\/\/doi.org\/10.1016\/s0898-1221(99)00075-9","journal-title":"Comput. Math. Appl."},{"key":"1184_CR55","unstructured":"Wiese, S.: A computational practicability study of MIQCQP reformulations. https:\/\/docs.mosek.com\/whitepapers\/miqcqp.pdf (2021). Accessed 22 Feb 2021"},{"issue":"1","key":"1184_CR56","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1287\/ijoc.2018.0883","volume":"32","author":"W Xia","year":"2020","unstructured":"Xia, W., Vera, J.C., Zuluaga, L.F.: Globally solving nonconvex quadratic programs via linear integer programming techniques. INFORMS J. Comput. 32(1), 40\u201356 (2020). https:\/\/doi.org\/10.1287\/ijoc.2018.0883","journal-title":"INFORMS J. Comput."},{"key":"1184_CR57","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.neunet.2017.07.002","volume":"94","author":"D Yarotsky","year":"2017","unstructured":"Yarotsky, D.: Error bounds for approximations with deep relu networks. Neural Netw. 94, 103\u2013114 (2017)","journal-title":"Neural Netw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01184-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01184-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01184-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T06:17:07Z","timestamp":1666246627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01184-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,13]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1184"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01184-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,13]]},"assertion":[{"value":"27 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}