{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:37Z","timestamp":1772614477720,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,7,6]],"date-time":"2014-07-06T00:00:00Z","timestamp":1404604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10898-014-0217-8","type":"journal-article","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T04:37:46Z","timestamp":1404535066000},"page":"373-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming"],"prefix":"10.1007","volume":"60","author":[{"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":[[2014,7,6]]},"reference":[{"key":"217_CR1","unstructured":"CMU-IBM open source minlp project"},{"issue":"2","key":"217_CR2","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.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"217_CR3","doi-asserted-by":"crossref","unstructured":"Bonami, Pierre, Gon\u00e7alves, Jo\u00e3o: Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl., pp. 1\u201319 (2008). doi: 10.1007\/s10589-010-9350-6","DOI":"10.1007\/s10589-010-9350-6"},{"key":"217_CR4","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. Technical report 1664, Computer Sciences Department, University of Wisconsin-Madison (2009)"},{"key":"217_CR5","unstructured":"Bonami, P., Lee, J., Leyffer, S., Wachter, A.: More branch-and-bound experiments in convex nonlinear integer programming. InReport 0 (2011)"},{"key":"217_CR6","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, 359\u2013367 (1994)","journal-title":"Comput. Oper. Res."},{"key":"217_CR7","unstructured":"Christodoulou, M., Costoulakis, C.: Nonlinear mixed integer programming for aircraft collision avoidance in free flight. In: Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference, 2004 MELECON 2004. vol. 1, pp. 327\u2013330, May (2004)"},{"key":"217_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M Duran","year":"1986","unstructured":"Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986). doi: 10.1007\/BF02592064","journal-title":"Math. Program."},{"key":"217_CR9","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, 237\u2013260 (1972). doi: 10.1007\/BF00934810","journal-title":"J. Optim. Theory Appl."},{"key":"217_CR10","doi-asserted-by":"crossref","unstructured":"Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3(3), 227\u2013252 (2002)","DOI":"10.1023\/A:1021039126272"},{"key":"217_CR11","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). doi: 10.1023\/A:1025154322278","journal-title":"Comput. Optim. Appl."},{"key":"217_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-1-4614-1927-3_4","volume-title":"Mixed Integer Nonlinear Programming, volume of The IMA Volumes in Mathematics and Its Applications","author":"IE Grossmann","year":"2012","unstructured":"Grossmann, I.E., Ruiz, J.P.: Generalized disjunctive programming: a framework for formulation and alternative algorithms for minlp optimization. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, volume of The IMA Volumes in Mathematics and Its Applications, pp. 93\u2013115. Springer, New York (2012). doi: 10.1007\/978-1-4614-1927-3_4"},{"issue":"12","key":"217_CR13","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."},{"issue":"3","key":"217_CR14","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 of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"9\u201310","key":"217_CR15","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/S0098-1354(00)00581-0","volume":"24","author":"S Lee","year":"2000","unstructured":"Lee, S., Grossmann, I.E.: New algorithms for nonlinear generalized disjunctive programming. Comput. Chem. Eng. 24(9\u201310), 2125\u20132141 (2000)","journal-title":"Comput. Chem. Eng."},{"key":"217_CR16","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":"217_CR17","doi-asserted-by":"crossref","first-page":"012014","DOI":"10.1088\/1742-6596\/180\/1\/012014","volume":"180","author":"S Leyffer","year":"2009","unstructured":"Leyffer, S., Linderoth, J., Luedtke, J., Miller, A., Munson, T.: Applications and algorithms for mixed integer nonlinear programming. J. Phys. Conf. Ser. 180(1), 012014 (2009)","journal-title":"J. Phys. Conf. Ser."},{"key":"217_CR18","unstructured":"Melo, W.: Agoritmos para programa\u00e7\u00e3o n\u00e3o linear inteira mista (Algorithms for Mixed Integer Nonlinear Programming). Master thesis, COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, RJ, Brasil, (2012) Printed in Portuguese"},{"key":"217_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10589-008-9218-1","volume":"47","author":"W Murray","year":"2010","unstructured":"Murray, W., Ng, K.-M.: An algorithm for nonlinear optimization problems with binary variables. Comput. Optim. Appl. 47, 257\u2013288 (2010). doi: 10.1007\/s10589-008-9218-1","journal-title":"Comput. Optim. Appl."},{"key":"217_CR20","doi-asserted-by":"crossref","unstructured":"Quesada, I., Grossmann, I.E.: An lp\/nlp based branch and bound algorithm for convex minlp optimization problems. Comput .Chem. Eng., 16(10\u201311), 937\u2013947, (1992). An International Journal of Computer Applications in Chemical Engineering","DOI":"10.1016\/0098-1354(92)80028-8"},{"key":"217_CR21","doi-asserted-by":"crossref","unstructured":"Raman, R., Grossmann, I.E.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng., 18(7), 563\u2013578 (1994). An International Journal of Computer Applications in Chemical Engineering","DOI":"10.1016\/0098-1354(93)E0010-7"},{"key":"217_CR22","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, 63\u201383 (2006). doi: 10.1007\/s10589-005-3076-x","journal-title":"Comput. Optim. Appl."},{"key":"217_CR23","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, 515\u2013532 (1999). doi: 10.1007\/s101070050103","journal-title":"Math. Program."},{"key":"217_CR24","doi-asserted-by":"crossref","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex minlp problems. Comput. Chem. Eng. 19(Supplement 10, 131\u2013136 (1995). European Symposium on Computer Aided Process Engineering","DOI":"10.1016\/0098-1354(95)87027-X"},{"issue":"20","key":"217_CR25","doi-asserted-by":"crossref","first-page":"7802","DOI":"10.1021\/ie800257x","volume":"47","author":"F You","year":"2008","unstructured":"You, F., Grossmann, I.E.: Mixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory management. Ind. Eng. Chem. Res. 47(20), 7802\u20137817 (2008)","journal-title":"Ind. Eng. Chem. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0217-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0217-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0217-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T08:46:42Z","timestamp":1565599602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0217-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,6]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["217"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0217-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,6]]}}}