{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T18:19:50Z","timestamp":1764872390072},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,22]],"date-time":"2012-11-22T00:00:00Z","timestamp":1353542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10898-012-0010-5","type":"journal-article","created":{"date-parts":[[2012,11,22]],"date-time":"2012-11-22T13:28:52Z","timestamp":1353590932000},"page":"877-899","source":"Crossref","is-referenced-by-count":4,"title":["Inexact solution of NLP subproblems in MINLP"],"prefix":"10.1007","volume":"55","author":[{"given":"M.","family":"Li","sequence":"first","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,22]]},"reference":[{"key":"10_CR1","unstructured":"CMU\/IBM MINLP Project. http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm"},{"key":"10_CR2","unstructured":"IBM ILOG CPLEX. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer . Version 12.4, 2012"},{"key":"10_CR3","unstructured":"Ahlat\u00e7\u0131o\u011flu, A., Guignard, M.: Convex hull relaxation (CHR) for convex and nonconvex MINLP problems with linear constraints (2011)"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P. Belotti","year":"2009","unstructured":"Belotti P., Lee J., Liberti L., Margot F., W\u00e4chter A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"10_CR6","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. Discret. Optim. 5, 186\u2013204 (2008)","journal-title":"Discret. Optim."},{"key":"10_CR7","doi-asserted-by":"crossref","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.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119, 331\u2013352 (2009)","journal-title":"Math. Program."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-010-9350-6","volume":"51","author":"P. Bonami","year":"2012","unstructured":"Bonami P., Gon\u00e7alves J.P.M.: Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl. 51, 729\u2013747 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.compchemeng.2005.07.012","volume":"30","author":"I. Castillo","year":"2005","unstructured":"Castillo I., Westerlund J., Emet S., Westerlund T.: Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54\u201369 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran M.A., Grossmann I.E.: An out-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"10_CR11","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":"10_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01580620","volume":"60","author":"O.E. Flippo","year":"1993","unstructured":"Flippo O.E., Rinnooy Kan A.H.G.: Decomposition in general mathematical programming. Math. Program. 60, 361\u2013382 (1993)","journal-title":"Math. Program."},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion A.M.: Generalized Benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"I.E. Grossmann","year":"2002","unstructured":"Grossmann I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227\u2013252 (2002)","journal-title":"Optim. Eng."},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10_CR16","unstructured":"Leyffer, S.: MacMINLP. http:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/MacMINLP"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., W\u00e4chter, A.: A probing algorithm for MINLPs with early detection of failures by SVM. In: CPAIOR 2011: The 8th International Conference on Integration of Artificial Intelligence and Operations Research, volume 6697 of Lecture Notes in Computer Science, pp. 154\u2013169. Springer, New York (2011)","DOI":"10.1007\/978-3-642-21311-3_15"},{"key":"10_CR18","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":"10_CR19","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani M., Sahinidis N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"10_CR20","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.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1021091110342","volume":"3","author":"T. Westerlund","year":"2002","unstructured":"Westerlund T., P\u00f6rn R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3, 253\u2013280 (2002)","journal-title":"Optim. Eng."},{"key":"10_CR22","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0098-1354(97)00000-8","volume":"22","author":"T. Westerlund","year":"1998","unstructured":"Westerlund T., Skrifvars H., Harjunkoski I., P\u00f6rn R.: An extended cutting plane method for a class of non-convex MINLP problems. Comput. Chem. Eng. 22, 357\u2013365 (1998)","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0010-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-0010-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0010-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T19:36:39Z","timestamp":1562355399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-0010-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,22]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-0010-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,22]]}}}