{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:07:38Z","timestamp":1771337258023,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T00:00:00Z","timestamp":1525996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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"}]},{"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10479-018-2872-5","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T06:18:42Z","timestamp":1526019522000},"page":"217-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An overview of MINLP algorithms and their implementation in Muriqui Optimizer"],"prefix":"10.1007","volume":"286","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":[[2018,5,11]]},"reference":[{"issue":"1","key":"2872_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-013-0060-9","volume":"6","author":"T Berthold","year":"2014","unstructured":"Berthold, T. (2014). Rens. Mathematical Programming Computation, 6(1), 33\u201354.","journal-title":"Mathematical Programming Computation"},{"key":"2872_CR2","unstructured":"Bonami, P., Kilin\u00e7, M., & Linderoth, J.\u00a02009). Algorithms and software for convex mixed integer nonlinear programs. Technical Report 1664, Computer Sciences Department, University of Wisconsin-Madison."},{"issue":"2","key":"2872_CR3","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":"2872_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Cornu\u00e9jols, G., Lodi, A., & Margot, F. (2009). A feasibility pump for mixed integer nonlinear programs. Mathematical Programming, 119, 331\u2013352. \nhttps:\/\/doi.org\/10.1007\/s10107-008-0212-2\n\n.","journal-title":"Mathematical Programming"},{"key":"2872_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9350-6","author":"P Bonami","year":"2008","unstructured":"Bonami, P., & Gon\u00e7alves, J. P. (2008). Heuristics for convex mixed integer nonlinear programs. Computational Optimization and Applications,. \nhttps:\/\/doi.org\/10.1007\/s10589-010-9350-6\n\n.","journal-title":"Computational Optimization and Applications"},{"key":"2872_CR6","unstructured":"Bonami, P., Lee, J., Leyffer, S., & W\u00e4chter, A. (2013). On branching rules for convex mixed-integer nonlinear optimization. Journal of Experimental Algorithmics, 18, 2.6:2.1\u20132.6:2.31."},{"key":"2872_CR7","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. Computers & Operations Research, 21, 359\u2013367.","journal-title":"Computers & Operations Research"},{"key":"2872_CR8","doi-asserted-by":"publisher","unstructured":"Bussieck, M. R., & Vigerske, S. (2011). MINLP Solver Software. In J. J. Cochran, L. A. Cox, P. Keskinocak, J. P. Kharoufeh & J. C. Smith (Eds.), Wiley encyclopedia of operations research and management science. \nhttps:\/\/doi.org\/10.1002\/9780470400531.eorms0527\n\n.","DOI":"10.1002\/9780470400531.eorms0527"},{"key":"2872_CR9","unstructured":"CMU-IBM. (2012). Open source Minlp project. \nhttp:\/\/egon.cheme.cmu.edu\/ibm\/page.htm\n\n."},{"key":"2872_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio, C., & Lodi, A. (2011). Mixed integer nonlinear programming tools: A practical overview. 4OR, 9(4), 329\u2013349.","DOI":"10.1007\/s10288-011-0181-9"},{"key":"2872_CR11","unstructured":"Dash Optimization (2003). Getting Started with Xpress. \nhttp:\/\/www.fico.com\/xpress\n\n."},{"key":"2872_CR12","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. \nhttps:\/\/doi.org\/10.1007\/BF02592064\n\n.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2872_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10589-016-9835-z","volume":"65","author":"M Fampa","year":"2016","unstructured":"Fampa, M., Lee, J., & Melo, W. (2016). A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. Computational Optimization and Applications, 65(1), 47\u201371. \nhttps:\/\/doi.org\/10.1007\/s10589-016-9835-z\n\n.","journal-title":"Computational Optimization and Applications"},{"key":"2872_CR14","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. \nhttps:\/\/doi.org\/10.1007\/BF01581153\n\n.","journal-title":"Mathematical Programming"},{"key":"2872_CR15","unstructured":"GAMS World. (2014). Minlp library 2. \nhttp:\/\/www.gamsworld.org\/minlp\/minlplib2\/html\/\n\n."},{"key":"2872_CR16","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. \nhttps:\/\/doi.org\/10.1007\/BF00934810\n\n.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2872_CR17","unstructured":"Gu, Z., Rothberg, E., & Bixby, R. E. Gurobi 4.6.1. Houston, TX."},{"issue":"12","key":"2872_CR18","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta, O. K., & Ravindran, A. (1985). Branch and bound experiments in convex nonlinear integer programming. Management Science, 31(12), 1533\u20131546.","journal-title":"Management Science"},{"key":"2872_CR19","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-68279-0_15","volume-title":"50 Years of Integer Programming 1958-2008","author":"Raymond Hemmecke","year":"2009","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. \nhttps:\/\/doi.org\/10.1007\/978-3-540-68279-0_15\n\n."},{"key":"2872_CR20","unstructured":"IBM Corporation. (2015). IBM ILOG CPLEX V12.6 User\u2019s Manual for CPLEX."},{"key":"2872_CR21","unstructured":"Intel Corporation. (2016). Intel C++ Compiler 16.0 User and Reference Guide."},{"issue":"2","key":"2872_CR22","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":"2872_CR23","unstructured":"Leyffer, S. (2003). MacMINLP: Test problems for mixed integer nonlinear programming. \nhttps:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/macminlp\n\n."},{"key":"2872_CR24","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. Computational Optimization and Applications, 18, 295\u2013309.","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"2872_CR25","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"},{"key":"2872_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10898-006-9128-7","volume":"39","author":"D Li","year":"2007","unstructured":"Li, D., Wang, J., & Sun, X. L. (2007). Computing exact solution to nonlinear integer programming: Convergent lagrangian and objective level cut method. Journal of Global Optimization, 39, 127\u2013154.","journal-title":"Journal of Global Optimization"},{"key":"2872_CR27","unstructured":"Massachusetts\u00a0Institute of\u00a0Technology. The mit license. \nhttps:\/\/mit-license.org.License\n\n."},{"issue":"2","key":"2872_CR28","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":"2872_CR29","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10898-018-0623-4","volume":"71","author":"Wendel 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. \nhttps:\/\/doi.org\/10.1007\/s10898-018-0623-4\n\n.","journal-title":"Journal of Global Optimization"},{"key":"2872_CR30","unstructured":"MOSEK ApS. (2017). The MOSEK optimization toolbox for MATLAB manual. Version 8.0."},{"key":"2872_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10589-008-9218-1","volume":"47","author":"W Murray","year":"2010","unstructured":"Murray, W., & Ng, K.-M. (2010). An algorithm for nonlinear optimization problems with binary variables. Computational Optimization and Applications, 47, 257\u2013288. \nhttps:\/\/doi.org\/10.1007\/s10589-008-9218-1\n\n.","journal-title":"Computational Optimization and Applications"},{"issue":"10\u201311","key":"2872_CR32","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.","journal-title":"Computers & Chemical Engineering"},{"key":"2872_CR33","unstructured":"Science Technology\u00a0Facilities Council. (2014). Hsl. a collection of fortran codes for large scale scientific computation. Software."},{"issue":"2","key":"2872_CR34","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2005.02.045","volume":"173","author":"C Still","year":"2006","unstructured":"Still, C., & Westerlund, T. (2006). A sequential cutting plane algorithm for solving convex NLP problems. European Journal of Operational Research, 173(2), 444\u2013464.","journal-title":"European Journal of Operational Research"},{"key":"2872_CR35","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10589-005-3076-x","volume":"34","author":"C Still","year":"2006","unstructured":"Still, C., & Westerlund, T. (2006). Solving convex minlp optimization problems using a sequential cutting plane algorithm. Computational Optimization and Applications, 34, 63\u201383. \nhttps:\/\/doi.org\/10.1007\/s10589-005-3076-x\n\n.","journal-title":"Computational Optimization and Applications"},{"key":"2872_CR36","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R. A., & Mehrotra, S. (1999). A branch-and-cut method for 0\u20131 mixed convex programming. Mathematical Programming, 86, 515\u2013532. \nhttps:\/\/doi.org\/10.1007\/s101070050103\n\n.","journal-title":"Mathematical Programming"},{"issue":"7","key":"2872_CR37","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":"1","key":"2872_CR38","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/opre.15.1.147","volume":"15","author":"AF Veinott","year":"1967","unstructured":"Veinott, A. F. (1967). The supporting hyperplane method for unimodal programming. Operations Research, 15(1), 147\u2013152.","journal-title":"Operations Research"},{"key":"2872_CR39","doi-asserted-by":"publisher","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. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106, 25\u201357. \nhttps:\/\/doi.org\/10.1007\/s10107-004-0559-y\n\n.","journal-title":"Mathematical Programming"},{"issue":"Supplement 1","key":"2872_CR40","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), 131\u2013136.","journal-title":"Computers & Chemical Engineering"},{"key":"2872_CR41","unstructured":"Wolsey, L. A. (1998). Integer programming., Series in discrete mathematics and optimization New York: Wiley."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2872-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2872-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2872-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T13:18:55Z","timestamp":1580995135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2872-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,11]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2872"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2872-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,11]]},"assertion":[{"value":"11 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}