{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T08:23:25Z","timestamp":1768897405712,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["303898\/2016-0"],"award-info":[{"award-number":["303898\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["434683\/2018-3"],"award-info":[{"award-number":["434683\/2018-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["307679\/2016-0"],"award-info":[{"award-number":["307679\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10479-020-03722-5","type":"journal-article","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T11:02:48Z","timestamp":1595070168000},"page":"1471-1491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two linear approximation algorithms for convex mixed integer nonlinear programming"],"prefix":"10.1007","volume":"316","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0586-9157","authenticated-orcid":false,"given":"Wendel","family":"Melo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcia","family":"Fampa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernanda","family":"Raupp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"3722_CR1","unstructured":"Bonami, P., Kilin\u00e7, M., & Linderoth, J. (2009). Algorithms and software for convex mixed integer nonlinear programs. Technical Report 1664, Computer Sciences Department, University of Wisconsin-Madison."},{"issue":"2","key":"3722_CR2","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., et al. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2), 186\u2013204.","journal-title":"Discrete Optimization"},{"key":"3722_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., & Mitchell, J. E. (1994). An improved branch and bound algorithm for mixed integer nonlinear programs. Computer Operations Research, 21, 359\u2013367.","journal-title":"Computer Operations Research"},{"key":"3722_CR4","unstructured":"CMU-IBM. (2012). Open source minlp project,http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm."},{"issue":"4","key":"3722_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10288-011-0181-9","volume":"9","author":"C D\u2019Ambrosio","year":"2011","unstructured":"D\u2019Ambrosio, C., & Lodi, A. (2011). Mixed integer nonlinear programming tools: a practical overview. 4OR, 9(4), 329\u2013349.","journal-title":"4OR"},{"key":"3722_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M Duran","year":"1986","unstructured":"Duran, M., & Grossmann, I. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming, 36, 307\u2013339. https:\/\/doi.org\/10.1007\/BF02592064.","journal-title":"Mathematical Programming"},{"key":"3722_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., & Leyffer, S. (1994). Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming, 66, 327\u2013349. https:\/\/doi.org\/10.1007\/BF01581153.","journal-title":"Mathematical Programming"},{"key":"3722_CR8","unstructured":"GAMS World. (2014). Minlp library 2. http:\/\/www.gamsworld.org\/minlp\/minlplib2\/html\/."},{"key":"3722_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A. M. (1972). Generalized benders decomposition. Journal of Optimization Theory and Applications, 10, 237\u2013260. https:\/\/doi.org\/10.1007\/BF00934810.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3722_CR10","unstructured":"Gurobi Optimization, LLC. (2020). Gurobi optimizer reference manual. https:\/\/www.gurobi.com."},{"key":"3722_CR11","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-68279-0_15","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"R Hemmecke","year":"2010","unstructured":"Hemmecke, R., K\u00f6ppe, M., Lee, J., & Weismantel, R. (2010). Nonlinear integer programming. In M. J\u00fcnger, T. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, & L. A. Wolsey (Eds.), 50 Years of Integer Programming 1958\u20132008 (pp. 561\u2013618). Berlin: Springer. https:\/\/doi.org\/10.1007\/978-3-540-68279-0_15."},{"key":"3722_CR12","unstructured":"IBM Corporation. (2015). IBM ILOG CPLEX V12.6 User\u2019s Manual for CPLEX."},{"key":"3722_CR13","unstructured":"Intel Corporation. (2017). Icpc: Intel c++ compiler. Software."},{"issue":"4","key":"3722_CR14","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J. E, Jr. (1960). The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8(4), 703\u2013712.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"3722_CR15","doi-asserted-by":"publisher","unstructured":"Kronqvist, J., Bernal, D. E., & Grossmann, I. E. (2018). Using regularization and second order information in outer approximation for convex MINLP. Mathematical Programming, 180, 285\u2013310. https:\/\/doi.org\/10.1007\/s10107-018-1356-3.","DOI":"10.1007\/s10107-018-1356-3"},{"key":"3722_CR16","doi-asserted-by":"publisher","unstructured":"Kronqvist, J., Bernal, D. E., Lundell, A., & Grossmann, I. E. (2019). A review and comparison of solvers for convex MINLP. Optimization and Engineering, 20, 397\u2013455. https:\/\/doi.org\/10.1007\/s11081-018-9411-8.","DOI":"10.1007\/s11081-018-9411-8"},{"issue":"2","key":"3722_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2016","unstructured":"Kronqvist, J., Lundell, A., & Westerlund, T. (2016). The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. Journal of Global Optimization, 64(2), 249\u2013272.","journal-title":"Journal of Global Optimization"},{"key":"3722_CR18","series-title":"Computer Aided Chemical Engineering","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1016\/B978-0-444-63965-3.50357-3","volume-title":"27th European Symposium on Computer Aided Process Engineering","author":"J Kronqvist","year":"2017","unstructured":"Kronqvist, J., Lundell, A., & Westerlund, T. (2017). A center-cut algorithm for solving convex mixed-integer nonlinear programming problems. In A. Espuna, M. Graells, & L. Puigjaner (Eds.), 27th European Symposium on Computer Aided Process Engineering (Vol. 40, pp. 2131\u20132136)., Computer Aided Chemical Engineering Elsevier: Amsterdam."},{"key":"3722_CR19","unstructured":"Leyffer, S. (2013). Macminlp: Test problems for mixed integer nonlinear programming, 2003. https:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/macminlp."},{"key":"3722_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S. (2001). Integrating sqp and branch-and-bound for mixed integer nonlinear programming. Computer Optimization Applications, 18, 295\u2013309.","journal-title":"Computer Optimization Applications"},{"issue":"1","key":"3722_CR21","first-page":"012014","volume":"180","author":"S Leyffer","year":"2009","unstructured":"Leyffer, S., Linderoth, J., Luedtke, J., Miller, A., & Munson, T. (2009). Applications and algorithms for mixed integer nonlinear programming. Journal of Physics: Conference Series, 180(1), 012014.","journal-title":"Journal of Physics: Conference Series"},{"issue":"2","key":"3722_CR22","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10898-014-0217-8","volume":"60","author":"W Melo","year":"2014","unstructured":"Melo, W., Fampa, M., & Raupp, F. (2014). Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming. Journal of Global Optimization, 60(2), 373\u2013389.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"3722_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10898-018-0623-4","volume":"71","author":"W Melo","year":"2018","unstructured":"Melo, W., Fampa, M., & Raupp, F. (2018). Integrality gap minimization heuristics for binary mixed integer nonlinear programming. Journal of Global Optimization, 71(3), 593\u2013612.","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"3722_CR24","first-page":"217","volume":"286","author":"W Melo","year":"2018","unstructured":"Melo, W., Fampa, M., & Raupp, F. (2018). An overview of minlp algorithms and their implementation in muriqui optimizer. Annals of Operations Research, 286(1), 217\u2013241.","journal-title":"Annals of Operations Research"},{"key":"3722_CR25","unstructured":"MOSEK ApS. (2019). The mosek optimization toolbox for matlab manual - release 8.10.80. Software."},{"issue":"10\u201311","key":"3722_CR26","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., & Grossmann, I. E. (1992). An lp\/nlp based branch and bound algorithm for convex minlp optimization problems. Computers & Chemical Engineering, 16(10\u201311), 937\u2013947. An International Journal of Computer Applications in Chemical Engineering.","journal-title":"Computers & Chemical Engineering"},{"issue":"7","key":"3722_CR27","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1002\/cite.201400037","volume":"86","author":"F Trespalacios","year":"2014","unstructured":"Trespalacios, F., & Grossmann, I. E. (2014). Review of mixed-integer nonlinear and generalized disjunctive programming methods. Chemie Ingenieur Technik, 86(7), 991\u20131012.","journal-title":"Chemie Ingenieur Technik"},{"issue":"Supplement 1(0)","key":"3722_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., & Pettersson, F. (1995). An extended cutting plane method for solving convex minlp problems. Computers & Chemical Engineering, 19(Supplement 1(0)), 131\u2013136. European Symposium on Computer Aided Process Engineering.","journal-title":"Computers & Chemical Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03722-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03722-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03722-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T13:39:07Z","timestamp":1664977147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03722-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,18]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3722"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03722-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,18]]},"assertion":[{"value":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}