{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:47:10Z","timestamp":1770738430442,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1023\/a:1025154322278","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:25:03Z","timestamp":1063736703000},"page":"83-100","source":"Crossref","is-referenced-by-count":126,"title":["Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation"],"prefix":"10.1007","volume":"26","author":[{"given":"Ignacio E.","family":"Grossmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangbum","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5141769_CR1","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"E. Balas, \u201cDisjunctive programming and a hierarchy of relaxations for discrete optimization problems,\u201d SIAM J. Alg. Disc. Meth., vol. 6, pp. 466-486, 1985.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"5141769_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria, and G. Cornuejols, \u201cA lift and project cutting plane algorithm for mixed 0\u20131 programs,\u201d Mathematical Programming, vol. 58, pp. 295-324, 1993.","journal-title":"Mathematical Programming"},{"key":"5141769_CR3","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(90)90419-C","volume":"48","author":"N. Beaumont","year":"1990","unstructured":"N. Beaumont, \u201cAn algorithm for disjunctive programs,\u201d European Journal of Operations Research, vol. 48, pp. 362-371, 1990.","journal-title":"European Journal of Operations Research"},{"key":"5141769_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B. Borchers","year":"1994","unstructured":"B. Borchers and J.E. Mitchell, \u201cAn improved branch and bound algorithm for mixed integer nonlinear programming,\u201d Computers and Operations Research, vol. 21, pp. 395-367, 1994.","journal-title":"Computers and Operations Research"},{"key":"5141769_CR5","unstructured":"A. Brooke, D. Kendrick, A. Meeraus, and R. Raman, GAMS Language Guide, Release 2.25, Version 92, GAMS Development Corporation, 1997."},{"key":"5141769_CR6","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"S. Ceria and J. Soares, \u201cConvex programming for disjunctive optimization,\u201d Mathematical Programming, vol. 86, pp. 595-614, 1999.","journal-title":"Mathematical Programming"},{"key":"5141769_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"M.A. Duran and I.E. Grossmann, \u201cAn outer-approximation algorithm for a class of mixed-integer nonlinear programs,\u201d Mathematical Programming, vol. 36, pp. 307-339, 1986.","journal-title":"Mathematical Programming"},{"key":"5141769_CR8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R. Fletcher","year":"1994","unstructured":"R. Fletcher and S. Leyffer, \u201cSolving mixed nonlinear programs by outer approximation,\u201d Mathematical Programming, vol. 66, pp. 327-349, 1994.","journal-title":"Mathematical Programming"},{"key":"5141769_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"A.M. Geoffrion, \u201cGeneralized benders decomposition,\u201d Journal of Optimization Theory and Application, vol. 10, pp. 237-260, 1972.","journal-title":"Journal of Optimization Theory and Application"},{"key":"5141769_CR10","doi-asserted-by":"crossref","unstructured":"I.E. Grossmann and Z. Kravanja, \u201cMixed-integer nonlinear programming: A survey of algorithms and applications,\u201d Large-Scale Optimization with Applications, Part II: Optimal Design and Control, L.T. Biegler et al. (Eds.), Springer-Verlag, 1997, pp. 73-100.","DOI":"10.1007\/978-1-4612-1960-6_5"},{"key":"5141769_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"I.E. Grossmann","year":"2002","unstructured":"I.E. Grossmann, \u201cReview of nonlinear mixed-integer and disjunctive programming techniques,\u201d Optimization and Engineering, vol. 3, pp. 227-252, 2002.","journal-title":"Optimization and Engineering"},{"key":"5141769_CR12","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O.K. Gupta","year":"1985","unstructured":"O.K. Gupta and V. Ravindran, \u201cBranch and bound experiments in convex nonlinear integer programming,\u201d Management Science, vol. 31, pp. 1533-1546, 1985.","journal-title":"Management Science"},{"key":"5141769_CR13","doi-asserted-by":"crossref","unstructured":"J. Hiriart-Urruty and C. Lemar\u00b4echal, Convex Analysis and Minimization Algorithms, vol. 1, Springer-Verlag, 1993.","DOI":"10.1007\/978-3-662-02796-7_1"},{"key":"5141769_CR14","doi-asserted-by":"crossref","unstructured":"J.N. Hooker, Logic-Based Methods for Optimization: Combining Optimization and Constraints Satisfaction, Wiley, 2000.","DOI":"10.1002\/9781118033036"},{"key":"5141769_CR15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"E.L. Johnson","year":"2000","unstructured":"E.L. Johnson, G.L. Nemhauser and M.W.P. Savelsbergh, \u201cProgress in linear programming based branch-andbound algorithms: An exposition,\u201d INFORMS Journal on Computing, vol. 12, pp. 2-23, 2000.","journal-title":"INFORMS Journal on Computing"},{"key":"5141769_CR16","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1016\/S0098-1354(00)00581-0","volume":"24","author":"S. Lee","year":"2000","unstructured":"S. Lee and I.E. Grossmann, \u201cNew algorithms for nonlinear generalized disjunctive programming,\u201d Computers Chem. Engng., vol. 24, pp. 2125-2141, 2000.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S. Leyffer","year":"2001","unstructured":"S. Leyffer, \u201cIntegratingSQPand branch-and-bound for mixed integer nonlinear programming,\u201d Computational Optimization and Applications, vol. 18, pp. 295-309, 2001.","journal-title":"Computational Optimization and Applications"},{"key":"5141769_CR18","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I. Quesada","year":"1992","unstructured":"I. Quesada and I.E. Grossmann, \u201cAn LP\/NLP based branch and bound algorithm for convex MINLP optimization problems,\u201d Computers Chem. Engng., vol. 16, pp. 937-947, 1992.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02023175","volume":"42","author":"R. Raman","year":"1993","unstructured":"R. Raman and I.E. Grossmann, \u201cSymbolic integration of logic in MILP branch and bound methods for the synthesis of process networks,\u201d Annals of Operations Research, vol. 42, pp. 169-191, 1993.","journal-title":"Annals of Operations Research"},{"key":"5141769_CR20","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R. Raman","year":"1994","unstructured":"R. Raman and I.E. Grossmann, \u201cModelling and computational techniques for logic based integer programming,\u201d Computers Chem. Engng., vol. 18, pp. 563-578, 1994.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR21","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. Stubbs","year":"1999","unstructured":"R. Stubbs and S. Mehrotra, \u201cA branch-and-cut method for 0-1 mixed convex programming,\u201d Mathematical Programming, vol. 86, pp. 515-532, 1999.","journal-title":"Mathematical Programming"},{"key":"5141769_CR22","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0098-1354(95)00219-7","volume":"20","author":"M. T\u00a8urkay","year":"1996","unstructured":"M. T\u00a8urkay and I.E. Grossmann, \u201cLogic-based MINLP algorithms for the optimal synthesis of process networks,\u201d Computers Chem. Engng., vol. 20, pp. 959-978, 1996.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR23","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T.J. Van Roy","year":"1987","unstructured":"T.J. Van Roy and L.A. Wolsey, \u201cSolving mixed 0-1 programs by automatic reformulation,\u201d Operations Research, vol. 35, pp. 45-57, 1987.","journal-title":"Operations Research"},{"key":"5141769_CR24","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0098-1354(98)00293-2","volume":"23","author":"A. Vecchietti","year":"1999","unstructured":"A. Vecchietti and I.E. Grossmann, \u201cLOGMIP: A disjunctive 0-1 nonlinear optimizer for process systems models,\u201d Computers Chem. Engng., vol. 23, pp. 555-565, 1999.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR25","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0098-1354(90)87085-4","volume":"14","author":"J. Viswanathan","year":"1990","unstructured":"J. Viswanathan and I.E. Grossmann, \u201cA combined penalty function and outer-approximation method for MINLP optimization,\u201d Computers Chem. Engng., vol. 14, pp. 769-782, 1990.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR26","doi-asserted-by":"crossref","first-page":"S131","DOI":"10.1016\/0098-1354(95)00164-W","volume":"19","author":"T. Westerlund","year":"1995","unstructured":"T. Westerlund and F. Petterson, \u201cAn extended cutting plane method for solving convex MINLP problems,\u201d Computers Chem. Engng., vol. 19, pp. S131-S136, 1995.","journal-title":"Computers Chem. Engng."},{"key":"5141769_CR27","unstructured":"H.P. Williams, Model Building in Mathematical Programming, John Wiley &; Sons, Inc., 1985."},{"key":"5141769_CR28","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1051\/ro\/1988220403311","volume":"22","author":"X. Yuan","year":"1988","unstructured":"X. Yuan, S. Zhang, L. Piboleau, and S. Domenech, \u201cUne methode d'optimization nonlineare en variables mixtes pour la conception de porcedes,\u201d Rairo Recherche Operationnele, vol. 22, p. 331, 1988.","journal-title":"Rairo Recherche Operationnele"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025154322278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025154322278\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025154322278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:06:58Z","timestamp":1752376018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025154322278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5141769"],"URL":"https:\/\/doi.org\/10.1023\/a:1025154322278","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}