{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:26:26Z","timestamp":1786145186087,"version":"3.56.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,18]],"date-time":"2007-12-18T00:00:00Z","timestamp":1197936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["cent.eur.j.oper.res."],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10100-007-0051-x","type":"journal-article","created":{"date-parts":[[2007,12,17]],"date-time":"2007-12-17T09:12:42Z","timestamp":1197882762000},"page":"127-138","source":"Crossref","is-referenced-by-count":22,"title":["LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs"],"prefix":"10.1007","volume":"16","author":[{"given":"Ivo","family":"Nowak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Vigerske","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,12,18]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00121749","volume":"9","author":"CS Adjiman","year":"1997","unstructured":"Adjiman CS and Floudas CA (1997). Rigorous convex underestimators for general twice-differentiable problems. J Global Optim 9: 23\u201340","journal-title":"J Global Optim"},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman CS, Dallwig S, Floudas CA and Neumaier A (1998). A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014I. Theor Adv Comp Chem Eng 22: 1137\u20131158","journal-title":"Theor Adv Comp Chem Eng"},{"key":"51_CR3","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"CS Adjiman","year":"2000","unstructured":"Adjiman CS, Androulakis IP and Floudas CA (2000). Global optimization of mixed-integer nonlinear problems. AIChE J 46: 1769\u20131797","journal-title":"AIChE J"},{"key":"51_CR4","unstructured":"Ahadi-Oskui T (2006) Optimierung des Entwurfs komplexer Energieumwandlungsanlagen. Fortschritts-Berichte VDI, Reihe 6, Nr. 543. VDI-Verlag"},{"key":"51_CR5","unstructured":"Ahadi-Oskui T, Tsatsaronis G (2006) Optimization of the design of a complex energy conversion system using mathematical programming and genetic algorithms. In: Proceedings of IMECE2006"},{"key":"51_CR6","unstructured":"Ahadi-Oskui T, Nowak I, Tsatsaronis G, Vigerske S (2007) Optimizing the design of complex energy conversion systems by Branch and Cut. Preprint 07-11. Department of Mathematics, Humboldt University Berlin, http:\/\/www.math.hu-berlin.de\/publ\/pre\/2007\/P-07-11.pdf (submitted)"},{"issue":"4","key":"51_CR7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10898-004-6455-4","volume":"30","author":"IG Akrotirianakis","year":"2004","unstructured":"Akrotirianakis IG and Floudas CA (2004). A new class of improved convex underestimators for twice differentiable constrained NLPs. J Global Optim 30(4): 367\u2013390","journal-title":"J Global Optim"},{"issue":"1","key":"51_CR8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck MR, Drud AS and Meeraus A (2003). MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J Comput 15(1): 114\u2013119","journal-title":"INFORMS J Comput"},{"key":"51_CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran MA and Grossmann IE (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Prog 36: 307\u2013339","journal-title":"Math Prog"},{"issue":"3(A)","key":"51_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher R and Leyffer S (1994). Solving mixed integer nonlinear programs by outer approximation. Math Program 66(3(A)): 327\u2013349","journal-title":"Math Program"},{"issue":"6","key":"51_CR11","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.compchemeng.2005.02.006","volume":"29","author":"CA Floudas","year":"2005","unstructured":"Floudas CA, Akrotirianakis IG, Caratzoulas C, Meyer CA and Kallrath J (2005). Global optimization in the 21st century: advances and challenges. Comput Chem Eng 29(6): 1185\u20131202","journal-title":"Comput Chem Eng"},{"key":"51_CR12","unstructured":"GAMS Development Corp. (2003) GAMS\u2014the solver manuals"},{"key":"51_CR13","unstructured":"Gon\u00e7alves JPM, Ladanyi L (2005) An implementation of a separation procedure for mixed integer rounding inequalities. Research Report RC23686, IBM Research Division, August"},{"key":"51_CR14","unstructured":"ILOG, Inc. CPLEX. http:\/\/www.ilog.com\/products\/cple ."},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Lougee-Heimer R (2003) The common optimization interface for operations research. IBM J Res Dev 47(1):57\u201366. http:\/\/www.coin-or.org","DOI":"10.1147\/rd.471.0057"},{"issue":"3","key":"51_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand H and Wolsey LA (2001). Aggregation and mixed integer rounding to solve MIPs. Oper Res 49(3): 363\u2013371","journal-title":"Oper Res"},{"issue":"6","key":"51_CR17","first-page":"1185","volume":"29","author":"CA Meyer","year":"2005","unstructured":"Meyer CA and Floudas CA (2005). Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: Spline \u03b1BB. J Global Optim 29(6): 1185\u20131202","journal-title":"J Global Optim"},{"key":"51_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL and Wolsey LA (1988). Integer and combinatorial optimization. Wiley-Interscience, New York"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Neumaier A (2004) Complete search in continuous global optimization and constraint satisfaction. In: Acta numerica, vol 13, chap 4. Cambridge University Press, Cambridge, pp 271\u2013370","DOI":"10.1017\/CBO9780511569975.004"},{"issue":"4","key":"51_CR20","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1008315627883","volume":"14","author":"I Nowak","year":"1999","unstructured":"Nowak I (1999). A new semidefinite programming bound for indefinite quadratic forms over a simplex. J Global Optim 14(4): 357\u2013364","journal-title":"J Global Optim"},{"issue":"2","key":"51_CR21","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-003-0500-9","volume":"102","author":"I Nowak","year":"2005","unstructured":"Nowak I (2005a). Lagrangian decomposition of block-separable mixed-integer all-quadratic programs. Math Program 102(2): 295\u2013312","journal-title":"Math Program"},{"key":"51_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/3-7643-7374-1","volume-title":"Relaxation and decomposition methods for mixed integer nonlinear programming","author":"I Nowak","year":"2005","unstructured":"Nowak I (2005b). Relaxation and decomposition methods for mixed integer nonlinear programming. Birkh\u00e4user, Basel"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Nowak I, Alperin H, Vigerske S (2003) LaGO\u2014an object oriented library for solving MINLPs. In: Bliek Ch, Jermann Ch, Neumaier A (eds) Global optimization and constraint satisfaction, volume 2861 of Lecture Notes in Computer Science. Springer, Heidelberg, pp 31\u201343","DOI":"10.1007\/978-3-540-39901-8_3"},{"key":"51_CR24","unstructured":"Nowak I, Vigerske S LaGO\u2014Lagrangian Global Optimizer. https:\/\/projects.coin-or.org\/LaGO"},{"key":"51_CR25","unstructured":"Sahinidis N, Tawarmalani M (2002) BARON. http:\/\/archimedes.scs.uiuc.edu\/baron\/baron.html"},{"key":"51_CR26","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani M and Sahinidis NV (2004). Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math Program 99: 563\u2013591","journal-title":"Math Program"},{"key":"51_CR27","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 and Sahinidis NV (2002). Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software and applications. Kluwer, Dordrecht"},{"issue":"7","key":"51_CR28","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 and Grossmann IE (1990). A combined penalty function and outer-approximation method for MINLP optimization. Comput Chem Eng 14(7): 769\u2013782","journal-title":"Comput Chem Eng"},{"key":"51_CR29","doi-asserted-by":"crossref","unstructured":"W\u00e4chter A, Biegler LT (2006) On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math Prog 106(1):25\u201357. http:\/\/projects.coin-or.org\/Ipopt","DOI":"10.1007\/s10107-004-0559-y"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-007-0051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-007-0051-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-007-0051-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T19:01:50Z","timestamp":1630350110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-007-0051-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,18]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s10100-007-0051-x","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,18]]}}}