{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:11:31Z","timestamp":1761487891548},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,7,25]],"date-time":"2007-07-25T00:00:00Z","timestamp":1185321600000},"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":[[2008,6]]},"DOI":"10.1007\/s10898-007-9203-8","type":"journal-article","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:12:50Z","timestamp":1185289970000},"page":"163-186","source":"Crossref","is-referenced-by-count":33,"title":["A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures"],"prefix":"10.1007","volume":"41","author":[{"given":"Ramkumar","family":"Karuppiah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,25]]},"reference":[{"key":"9203_CR1","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1021\/ie980666q","volume":"38","author":"N. Adhya","year":"1999","unstructured":"Adhya N., Tawarmalani M. and Sahinidis N.V. (1999). A Lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38: 1956\u20131972","journal-title":"Ind. Eng. Chem. Res."},{"key":"9203_CR2","doi-asserted-by":"crossref","first-page":"S445","DOI":"10.1016\/S0098-1354(97)87542-4","volume":"21","author":"C.S. Adjiman","year":"1997","unstructured":"Adjiman C.S., Androulakis I.P. and Floudas C.A. (1997). Global optimization of MINLP problems in process synthesis and design. Comp. Chem. Eng. 21: S445\u2013S450","journal-title":"Comp. Chem. Eng."},{"issue":"9","key":"9203_CR3","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"C.S. Adjiman","year":"2000","unstructured":"Adjiman C.S., Androulakis I.P. and Floudas C.A. (2000). Global optimization of mixed-integer nonlinear problems. Am. Inst. Chem. Eng. J. 46(9): 1769\u20131797","journal-title":"Am. Inst. Chem. Eng. J."},{"key":"9203_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E. Balas","year":"1972","unstructured":"Balas E. and Jeroslow R. (1972). Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23: 61\u201379","journal-title":"SIAM J. Appl. Math."},{"key":"9203_CR5","doi-asserted-by":"crossref","first-page":"1914","DOI":"10.1016\/j.compchemeng.2005.04.003","volume":"29","author":"M.L. Bergamini","year":"2005","unstructured":"Bergamini M.L., Aguirre P. and Grossmann I.E. (2005). Logic-based outer approximation for globally optimal synthesis of process networks. Comp. Chem. Eng. 29: 1914\u20131933","journal-title":"Comp. Chem. Eng."},{"key":"9203_CR6","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1016\/j.compchemeng.2003.11.003","volume":"28","author":"L.T. Biegler","year":"2004","unstructured":"Biegler L.T. and Grossmann I.E. (2004). Retrospective on optimization. Comp. Chem. Eng. 28: 1169\u20131192","journal-title":"Comp. Chem. Eng."},{"key":"9203_CR7","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge J.R. and Louveaux F.V. (1997). Introduction to Stochastic Programming. Springer, New York"},{"key":"9203_CR8","unstructured":"Brooke, A., Kendrick, D., Meeraus, A., Raman, R.: GAMS: A user\u2019s guide, release 2.50. GAMS Development Corporation (1998)"},{"key":"9203_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"C.C. Car\u00f8e","year":"1999","unstructured":"Car\u00f8e C.C. and Schultz R. (1999). Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24: 37\u201345","journal-title":"Oper. Res. Lett."},{"issue":"8","key":"9203_CR10","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1002\/aic.10494","volume":"51","author":"B. Chachuat","year":"2005","unstructured":"Chachuat B., Singer A.B. and Barton P.I. (2005). Global mixed-integer dynamic optimization. AICHE J. 51(8): 2235\u20132253","journal-title":"AICHE J."},{"key":"9203_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran M.A. and Grossmann I.E. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36: 307\u2013339","journal-title":"Math. Program."},{"issue":"1","key":"9203_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher M.L. (1981). The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27(1): 1\u201318","journal-title":"Manage. Sci."},{"issue":"2","key":"9203_CR13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"M.L. Fisher","year":"1985","unstructured":"Fisher M.L. (1985). An applications oriented guide to Lagrangian relaxation. Interfaces 15(2): 10\u201321","journal-title":"Interfaces"},{"key":"9203_CR14","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: 327\u2013349","journal-title":"Math. Program."},{"key":"9203_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4949-6","volume-title":"Deterministic Global Optimization: Theory, Methods and Applications","author":"C.A. Floudas","year":"2000","unstructured":"Floudas C.A. (2000). Deterministic Global Optimization: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands"},{"key":"9203_CR16","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.compchemeng.2005.02.006","volume":"29","author":"C.A. Floudas","year":"2005","unstructured":"Floudas C.A., Akrotirianakis I.G., Caratzoulas S., Meyer C.A. and Kallrath J. (2005). Global optimization in the 21st century: advances and challenges. Comp. Chem. Eng. 29: 1185\u20131202","journal-title":"Comp. Chem. Eng."},{"key":"9203_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"I.E. Grossmann","year":"2002","unstructured":"Grossmann I.E. (2002). Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3: 227\u2013252","journal-title":"Optim. Eng."},{"key":"9203_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M. Guignard","year":"1987","unstructured":"Guignard M. and Kim S. (1987). Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math. Program. 39: 215\u2013228","journal-title":"Math. Program."},{"key":"9203_CR19","doi-asserted-by":"crossref","first-page":"1937","DOI":"10.1021\/ie980782t","volume":"38","author":"A. Gupta","year":"1999","unstructured":"Gupta A. and Maranas C.D. (1999). A hierarchical Lagrangean relaxation procedure for solving midterm planning problems. Ind. Eng. Chem. Res. 38: 1937\u20131947","journal-title":"Ind. Eng. Chem. Res."},{"key":"9203_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1996","unstructured":"Horst R. and Tuy H. (1996). Global Optimization: Deterministic Approaches. Springer-Verlag, Berlin","edition":"3rd edn"},{"key":"9203_CR21","doi-asserted-by":"crossref","first-page":"3045","DOI":"10.1021\/ie030070p","volume":"42","author":"J.R. Jackson","year":"2003","unstructured":"Jackson J.R. and Grossmann I.E. (2003). Temporal decomposition scheme for nonlinear multisite production planning and distribution models. Ind. Eng. Chem. Res. 42: 3045\u20133055","journal-title":"Ind. Eng. Chem. Res."},{"key":"9203_CR22","unstructured":"Jornsten, K.O., Nasberg, M., Smeds, P.A.: Variable Splitting \u2013 A New Lagrangean Relaxation Approach to some Mathematical Programming Models. Department of Mathematics Report LiTH-MAT-R-85-04, Linkoping Institute of Technology, Sweden (1985)"},{"key":"9203_CR23","doi-asserted-by":"crossref","unstructured":"Karuppiah, R., Grossmann, I.E.: Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water networks under uncertainty. Comp. Chem. Eng. (2007, in press)","DOI":"10.1016\/S1570-7946(06)80300-7"},{"key":"9203_CR24","doi-asserted-by":"crossref","unstructured":"Karuppiah, R., Furman, K.C., Grossmann, I.E.: Global optimization for scheduling refinery crude oil operations. Comp. Chem. Eng. (2007, submitted)","DOI":"10.1016\/j.compchemeng.2007.11.008"},{"key":"9203_CR25","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10107-004-0503-1","volume":"100","author":"P. Kesavan","year":"2004","unstructured":"Kesavan P., Allgor R.J., Gatzke E.P. and Barton P.I. (2004). Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. Math. Program. 100: 517\u2013535","journal-title":"Math. Program."},{"key":"9203_CR26","unstructured":"Kiwiel, K.C.: User\u2019s Guide for NOA 2.0\/3.0: A Fortran Package for Convex Nondifferentiable Optimization. Polish Academy of Sciences, Systems Research Institute, Warsaw, Poland (1993\/1994)"},{"key":"9203_CR27","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1008373329033","volume":"18","author":"T. Kuno","year":"2000","unstructured":"Kuno T. and Utsunomiya T. (2000). A Lagrangian based branch-and-bound algorithm for production-transportation problems. J. Global Optim. 18: 59\u201373","journal-title":"J. Global Optim."},{"key":"9203_CR28","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1016\/S0098-1354(01)00732-3","volume":"25","author":"S. Lee","year":"2001","unstructured":"Lee S. and Grossmann I.E. (2001). A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems. Comp. Chem. Eng. 25: 1675\u20131697","journal-title":"Comp. Chem. Eng."},{"key":"9203_CR29","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01096720","volume":"4","author":"C.D. Maranas","year":"1994","unstructured":"Maranas C.D. and Floudas C.A. (1994). Global minimum potential energy conformation of small molecules. J. Global Optim. 4: 135\u2013170","journal-title":"J. Global Optim."},{"key":"9203_CR30","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick G.P. (1976). Computability of global solutions to factorable nonconvex programs \u2013 part I \u2013 convex underestimating problems. Math. Program. 10: 146\u2013175","journal-title":"Math. Program."},{"key":"9203_CR31","doi-asserted-by":"crossref","first-page":"6413","DOI":"10.1021\/ie020199j","volume":"41","author":"C.A. Meyer","year":"2002","unstructured":"Meyer C.A., Floudas C.A. and Neumaier A. (2002). Global optimization with nonfactorable constraints. Ind. Eng. Chem. Res. 41: 6413\u20136424","journal-title":"Ind. Eng. Chem. Res."},{"key":"9203_CR32","first-page":"425","volume":"83","author":"V.I. Norkin","year":"1998","unstructured":"Norkin V.I., Pflug G.Ch. and Ruszczynski A. (1998). A branch and bound method for stochastic global optimization. Math. Program. 83: 425\u2013450","journal-title":"Math. Program."},{"key":"9203_CR33","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. In: Iserles, A. (ed.) Acta Numerica 2004. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/S0962492904000194"},{"key":"9203_CR34","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0098-1354(03)00195-9","volume":"28","author":"I. Papamichail","year":"2004","unstructured":"Papamichail I. and Adjiman C.S. (2004). Global optimization of dynamic systems. Comp. Chem. Eng. 28: 403\u2013415","journal-title":"Comp. Chem. Eng."},{"key":"9203_CR35","doi-asserted-by":"crossref","first-page":"2655","DOI":"10.1016\/S0098-1354(00)00622-0","volume":"24","author":"R. P\u00f6rn","year":"2000","unstructured":"P\u00f6rn R. and Westerlund T. (2000). A cutting plane method for minimizing pseudo-convex functions in the mixed integer case. Comp. Chem. Eng. 24: 2655\u20132665","journal-title":"Comp. Chem. Eng."},{"key":"9203_CR36","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01106605","volume":"6","author":"I. Quesada","year":"1995","unstructured":"Quesada I. and Grossmann I.E. (1995). A global optimization algorithm for linear fractional and bilinear programs. J. Global Optim. 6: 39\u201376","journal-title":"J. Global Optim."},{"issue":"5","key":"9203_CR37","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H.S. Ryoo","year":"1995","unstructured":"Ryoo H.S. and Sahinidis N. (1995). Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comp. Chem. Eng. 19(5): 551\u2013556","journal-title":"Comp. Chem. Eng."},{"issue":"2","key":"9203_CR38","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N. Sahinidis","year":"1996","unstructured":"Sahinidis N. (1996). BARON: a general purpose global optimization software package. J. Global Optim. 8(2): 201\u2013205","journal-title":"J. Global Optim."},{"key":"9203_CR39","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D. and Alameddine A. (1992). A new reformulation linearization technique for bilinear programming problems. J. Global Optim. 2: 379\u2013410","journal-title":"J. Global Optim."},{"key":"9203_CR40","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/59.535691","volume":"11","author":"S. Takriti","year":"1996","unstructured":"Takriti S., Birge J.R. and Long E. (1996). A stochastic model of the unit commitment problem. IEEE Trans. Power Syst. 11: 1497\u20131508","journal-title":"IEEE Trans. Power Syst."},{"key":"9203_CR41","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 N. (2002). Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands"},{"issue":"3","key":"9203_CR42","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 N. (2004). Global optimization of mixed integer nonlinear programs: a theoretical and computational study. Math. Program. 99(3): 563\u2013591","journal-title":"Math. Program."},{"key":"9203_CR43","doi-asserted-by":"crossref","first-page":"2857","DOI":"10.1021\/ie000755e","volume":"40","author":"S.A. Heever van den","year":"2001","unstructured":"Grossmann I.E., Vasantharajan S., Edwards K. and Heever S.A. (2001). A Lagrangean decomposition heuristic for the design and planning of offshore hydrocarbon field infrastructures with complex economic objectives. Ind. Eng. Chem. Res. 40: 2857\u20132875","journal-title":"Ind. Eng. Chem. Res."},{"key":"9203_CR44","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0098-1354(78)80012-X","volume":"2","author":"A.W. Westerberg","year":"1978","unstructured":"Westerberg A.W. and Shah J.V. (1978). Assuring a global optimum by the use of an upper bound on the lower (dual) bound. Comp. Chem. Eng. 2: 83\u201392","journal-title":"Comp. Chem. Eng."},{"issue":"3","key":"9203_CR45","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"J.M. Zamora","year":"1999","unstructured":"Zamora J.M. and Grossmann I.E. (1999). A branch and bound algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Global Optim. 14(3): 217\u2013249","journal-title":"J. Global Optim."},{"key":"9203_CR46","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10898-005-0936-y","volume":"33","author":"Y. Zhu","year":"2005","unstructured":"Zhu Y. and Kuno T. (2005). A global optimization method, QBB, for twice-differentiable nonconvex optimization problem. J. Global Optim. 33: 435\u2013464","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9203-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-007-9203-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-007-9203-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T14:26:33Z","timestamp":1683987993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-007-9203-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,25]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9203"],"URL":"https:\/\/doi.org\/10.1007\/s10898-007-9203-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,25]]}}}