{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:49Z","timestamp":1772614489975,"version":"3.50.1"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T00:00:00Z","timestamp":1604707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T00:00:00Z","timestamp":1604707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12532-020-00196-1","type":"journal-article","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T03:02:46Z","timestamp":1604718166000},"page":"301-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Minotaur: a mixed-integer nonlinear optimization toolkit"],"prefix":"10.1007","volume":"13","author":[{"given":"Ashutosh","family":"Mahajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Leyffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Luedtke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Munson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,7]]},"reference":[{"key":"196_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.T.: FilMINT: an outer-approximation-based solver for nonlinear mixed integer programs. INFORMS J. Comput. 22, 555\u2013567 (2010). https:\/\/doi.org\/10.1287\/ijoc.1090.0373","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"196_CR2","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), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"196_CR3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2004","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2004)","journal-title":"Oper. Res. Lett."},{"key":"196_CR4","doi-asserted-by":"crossref","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-II. Implementation and computational results. Comput. Chem. Eng. 22, 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"196_CR5","unstructured":"Beale, E.W.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proceedings of the 5th International Conference on Operations Research, pp. 447\u2013454 (1969)"},{"key":"196_CR6","unstructured":"Belotti, P.: COUENNE: A user\u2019s manual. Technical report. Lehigh University (2009)"},{"key":"196_CR7","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.T., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1\u2013131 (2013)","journal-title":"Acta Numer."},{"issue":"6","key":"196_CR8","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1080\/10556781003799303","volume":"26","author":"HY Benson","year":"2011","unstructured":"Benson, H.Y.: Mixed integer nonlinear programming using interior point methods. Optim. Methods Softw. 26(6), 911\u2013931 (2011)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"196_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., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"196_CR10","doi-asserted-by":"crossref","first-page":"2.6:2.1","DOI":"10.1145\/2532568","volume":"18","author":"P Bonami","year":"2013","unstructured":"Bonami, P., Lee, J., Leyffer, S., W\u00e4chter, A.: On branching rules for convex mixed-integer nonlinear optimization. J. Exp. Algorithm. 18, 2.6:2.1\u20132.6:2.31 (2013)","journal-title":"J. Exp. Algorithm."},{"key":"196_CR11","volume-title":"GAMS, A User\u2019s Guide","author":"A Brooke","year":"1992","unstructured":"Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: GAMS, A User\u2019s Guide. GAMS Development Corporation, Fairfax (1992)"},{"key":"196_CR12","unstructured":"Bussieck, M.R., Drud, A.: SBB: a new solver for mixed integer nonlinear programming. Talk, OR 2001, Section Continuous Optimization (2001)"},{"issue":"1","key":"196_CR13","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"196_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization, Volume\u00a083 of Nonconvex Optimization and Its Applications","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Richard, W.A.: KNITRO: an integrated package for nonlinear optimization. In: Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, Volume\u00a083 of Nonconvex Optimization and Its Applications, pp. 35\u201359. Springer, Berlin (2006)"},{"issue":"2","key":"196_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/imanum\/12.2.135","volume":"12","author":"B Christianson","year":"1992","unstructured":"Christianson, B.: Automatic Hessians by reverse accumulations. IMA J. Numer. Anal. 12(2), 135\u2013150 (1992)","journal-title":"IMA J. Numer. Anal."},{"key":"196_CR16","unstructured":"CMU-IBM cyber-infrastructure for MINLP (2009). http:\/\/www.minlp.org\/"},{"key":"196_CR17","unstructured":"COIN-OR: Computational Infrastructure for Operations Research (2014). http:\/\/www.coin-or.org"},{"key":"196_CR18","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree search algorithm for mixed programming problems. Comput. J. 8, 250\u2013255 (1965)","journal-title":"Comput. J."},{"key":"196_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"196_CR20","unstructured":"Drewes, S.: Mixed Integer Second Order Cone Programming. Ph.D. thesis. Technische Universit\u00e4t Darmstadt (2009)"},{"key":"196_CR21","first-page":"41","volume-title":"Mixed Integer Nonlinear Programming, Volume 154 of the IMA Volumes in Mathematics and Its Applications","author":"S Drewes","year":"2012","unstructured":"Drewes, S., Ulbrich, S.: Subgradient based outer approximation for mixed integer second order cone programming. Mixed Integer Nonlinear Programming, Volume 154 of the IMA Volumes in Mathematics and Its Applications, pp. 41\u201359. Springer, New York (2012)"},{"key":"196_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"issue":"4","key":"196_CR23","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s12532-014-0071-1","volume":"6","author":"HJ Ferreau","year":"2014","unstructured":"Ferreau, H.J., Kirches, C., Potschka, A., Bock, H.G., Diehl, M.: qpOASES: a parametric active-set algorithm for quadratic programming. Math. Program. Comput. 6(4), 327\u2013363 (2014)","journal-title":"Math. Program. Comput."},{"key":"196_CR24","volume-title":"User Manual for BQPD","author":"R Fletcher","year":"1995","unstructured":"Fletcher, R.: User Manual for BQPD. University of Dundee, Dundee (1995)"},{"key":"196_CR25","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":"196_CR26","unstructured":"Fletcher, R., Leyffer, S.: User Manual for filterSQP. University of Dundee Numerical Analysis Report NA-181 (1998)"},{"key":"196_CR27","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239\u2013270 (2002)","journal-title":"Math. Program."},{"key":"196_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4949-6","volume-title":"Deterministic Global Optimization: Theory, Algorithms and Applications","author":"CA Floudas","year":"2000","unstructured":"Floudas, C.A.: Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"196_CR29","unstructured":"Forrest, J.: CLP (2014). http:\/\/www.coin-or.org\/"},{"key":"196_CR30","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"R Fourer","year":"1993","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. The Scientific Press, Cambridge (1993)"},{"key":"196_CR31","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10589-015-9787-8","volume":"63","author":"A Frangioni","year":"2016","unstructured":"Frangioni, A., Furini, F., Gentile, C.: Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63, 705\u2013735 (2016). https:\/\/doi.org\/10.1007\/s10589-015-9787-8","journal-title":"Comput. Optim. Appl."},{"key":"196_CR32","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. Program. 106, 225\u2013236 (2006)","journal-title":"Math. Program."},{"key":"196_CR33","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."},{"issue":"3","key":"196_CR34","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(3), 206\u2013210 (2009)","journal-title":"Oper. Res. Lett."},{"key":"196_CR35","unstructured":"Furman, K., Grossmann, I., Sawaya, N.: An exact MINLP formulation for nonlinear disjunctive programs based on the convex hull. In: Presented at the 20th International Symposium on Mathematical Programming, Chicago, IL (2009)"},{"key":"196_CR36","volume-title":"Computational Differentiation Techniques Applications and Tools","author":"DM Gay","year":"1996","unstructured":"Gay, D.M.: More AD of nonlinear AMPL models: computing Hessian information and exploiting partial separability. In: Berz, M., Bischof, C., Corliss, G., Griewank, A. (eds.) Computational Differentiation Techniques Applications and Tools. SIAM, Philadelphia (1996)"},{"issue":"2","key":"196_CR37","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/ijoc.1080.0286","volume":"21","author":"AH Gebremedhin","year":"2009","unstructured":"Gebremedhin, A.H., Tarafdar, A., Pothen, A., Walther, A.: Efficient computation of sparse Hessians using coloring and automatic differentiation. INFORMS J. Comput. 21(2), 209\u2013223 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"196_CR38","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"196_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), 1\u20135 (2016)","journal-title":"ACM Trans. Math. Softw."},{"key":"196_CR40","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives Principles and Techniques of Algorithmic Differentiation","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives Principles and Techniques of Algorithmic Differentiation, Second edn. SIAM, Philadelphia (2008)","edition":"Second"},{"key":"196_CR41","volume-title":"Large-Scale Optimization with Applications, Part II: Optimal Design and Control","author":"IE Grossmann","year":"1997","unstructured":"Grossmann, I.E., Kravanja, Z.: Mixed-integer nonlinear programming: a survey of algorithms and applications. In: Conn, A.R., Biegler, L.T., Coleman, T.F., Santosa, F.N. (eds.) Large-Scale Optimization with Applications, Part II: Optimal Design and Control. Springer, New York (1997)"},{"key":"196_CR42","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.) IPCO 2008: The Thirteenth Conference on Integer Programming and Combinatorial Optimization, vol. 5035, pp. 1\u201316 (2008)","DOI":"10.1007\/978-3-540-68891-4_1"},{"key":"196_CR43","first-page":"186","volume":"104","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.T.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. Math. Program. Ser. B 104, 186\u2013203 (2010)","journal-title":"Math. Program. Ser. B"},{"key":"196_CR44","first-page":"61","volume":"154","author":"O G\u00fcnl\u00fck","year":"2012","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.T.: Perspective reformulation and applications. IMA Vol. 154, 61\u201392 (2012)","journal-title":"IMA Vol."},{"key":"196_CR45","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":"196_CR46","unstructured":"Gurobi Optimization, Inc. Gurobi Optimizer Reference Manual, Version 5.6 (2014)"},{"key":"196_CR47","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s12532-011-0026-8","volume":"3","author":"WE Hart","year":"2011","unstructured":"Hart, W.E., Watson, J.-P., Woodruff, D.L.: Pyomo: modeling and solving mathematical programs in Python. Math. Program. Comput. 3, 219\u2013260 (2011)","journal-title":"Math. Program. Comput."},{"key":"196_CR48","unstructured":"IBM Corp. IBM ILOG CPLEX V12.6: User\u2019s Manual for CPLEX (2014)"},{"issue":"1","key":"196_CR49","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/opre.21.1.221","volume":"21","author":"RG Jeroslow","year":"1973","unstructured":"Jeroslow, R.G.: There cannot be any algorithm for integer programming with quadratic constraints. Oper. Res. 21(1), 221\u2013224 (1973)","journal-title":"Oper. Res."},{"key":"196_CR50","first-page":"161","volume-title":"Optimization and Operations Research, Volume 157 of Lecture Notes in Economics and Mathematical Systems","author":"R Kannan","year":"1978","unstructured":"Kannan, R., Monma, C.L.: On the computational complexity of integer programming problems. In: Henn, R., Korte, B., Oettli, W. (eds.) Optimization and Operations Research, Volume 157 of Lecture Notes in Economics and Mathematical Systems, pp. 161\u2013172. Springer, Berlin (1978)"},{"key":"196_CR51","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method for solving discrete programming problems. Econometrica 28, 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"196_CR52","first-page":"293","volume-title":"Integer Programming and Combinatorial Optimization 2001, Lecture Notes in Computer Science","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: An explicit exact SDP relaxation for nonlinear 0\u20131 programs. In: Aardal, K., Gerards, A.M.H. (eds.) Integer Programming and Combinatorial Optimization 2001, Lecture Notes in Computer Science, vol. 2081, pp. 293\u2013303. Springer, Berlin (2001)"},{"issue":"3","key":"196_CR53","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"196_CR54","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali\u2013Adams, Lov\u00e1sz\u2013Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"196_CR55","volume-title":"User Manual for MINLP-BB","author":"S Leyffer","year":"1998","unstructured":"Leyffer, S.: User Manual for MINLP-BB. University of Dundee, Dundee (1998)"},{"key":"196_CR56","unstructured":"Leyffer, S.: Mixed-Integer PDE-Constrained Optimization. Technical report. Argonne (2015)"},{"key":"196_CR57","doi-asserted-by":"crossref","unstructured":"Leyffer, S., Linderoth, J.T., Luedtke, J., Miller, A., Munson T.: Applications and algorithms for mixed integer nonlinear programming. In: Journal of Physics: Conference Series, SciDAC 2009, vol. 180, pp. 012014 (2009)","DOI":"10.1088\/1742-6596\/180\/1\/012014"},{"key":"196_CR58","unstructured":"Mahajan, A., Leyffer, S., Kirches, C.: Solving convex mixed-integer nonlinear programs by QP-diving. Preprint ANL\/MCS-P1801-101. Argonne National Laboratory (2010)"},{"key":"196_CR59","unstructured":"Mahajan, A., Leyffer, S., Kirches, C.: Solving mixed-integer nonlinear programs by QP-diving. Preprint ANL\/MCS-2071-0312. Argonne National Laboratory, Mathematics and Computer Science Division (2012)"},{"key":"196_CR60","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"196_CR61","first-page":"1","volume":"5","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 5, 1\u201348 (2012)","journal-title":"J. Glob. Optim."},{"key":"196_CR62","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for coNTinuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59, 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"196_CR63","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0962492904000194","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numer. 13, 271\u2013369 (2004)","journal-title":"Acta Numer."},{"key":"196_CR64","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"196_CR65","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.E.: 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":"196_CR66","first-page":"552","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19, 552\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"196_CR67","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"196_CR68","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"196_CR69","first-page":"243","volume-title":"Numerical Software with Result Verification, Volume 2991 of Lecture Notes in Computer Science","author":"H Schichl","year":"2004","unstructured":"Schichl, H.: Global optimization in the COCONUT project. In: Alt, R., Frommer, A., Baker Kearfott, R., Luther, W. (eds.) Numerical Software with Result Verification, Volume 2991 of Lecture Notes in Computer Science, pp. 243\u2013249. Springer, Berlin (2004)"},{"issue":"1","key":"196_CR70","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10589-005-3076-x","volume":"34","author":"C Still","year":"2006","unstructured":"Still, C., Westerlund, T.: Solving convex MINLP optimization problems using a sequential cutting plane algorithm. Comput. Optim. Appl. 34(1), 63\u201383 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"196_CR71","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Boston (2002)"},{"key":"196_CR72","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02591718","volume":"25","author":"TJ Van Roy","year":"1983","unstructured":"Van Roy, T.J.: Cross decomposition for mixed integer programming. Math. Program. 25, 145\u2013163 (1983)","journal-title":"Math. Program."},{"key":"196_CR73","unstructured":"Vigerske, S.: MINLPLib 2. In: Proceedings of the XII Global Optimization Workshop: Mathematical and Applied Global Optimization, pp. 137\u2013140 (2014)"},{"issue":"3","key":"196_CR74","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1335312","journal-title":"Optim. Methods Softw."},{"issue":"7","key":"196_CR75","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0098-1354(90)87085-4","volume":"14","author":"J Viswanathan","year":"1990","unstructured":"Viswanathan, J., Grossmann, I.E.: A combined penalty function and outer-approximation method for MINLP optimization. Comput. Chem. Eng. 14(7), 769\u2013782 (1990)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"196_CR76","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"196_CR77","unstructured":"Westerlund, T., Lundqvist, K.: Alpha-ECP, version 5.01: an interactive MINLP-solver based on the extended cutting plane method. Technical Report 01-178-A. Process Design Laboratory at \u00c5bo University (2001)"},{"key":"196_CR78","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: A cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"196_CR79","unstructured":"Ziena Optimization. KNITRO Documentation (2012)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00196-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-020-00196-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-020-00196-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T09:29:38Z","timestamp":1622539778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-020-00196-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,7]]},"references-count":79,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["196"],"URL":"https:\/\/doi.org\/10.1007\/s12532-020-00196-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,7]]},"assertion":[{"value":"16 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}