{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:56:51Z","timestamp":1725537411355},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_10","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:16:36Z","timestamp":1252952196000},"page":"107-118","source":"Crossref","is-referenced-by-count":7,"title":["A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity"],"prefix":"10.1007","author":[{"given":"Claudia","family":"D\u2019Ambrosio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"W\u00e4chter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Beale, E., Tomlin, J.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proc. of the 5\n                    th\n                   Int. Conf. on Operations Research, pp. 447\u2013454 (1970)"},{"key":"10_CR2","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP, IBM Research Report RC24620 (2008); to appear in: Optimization Methods and Software"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L., Conn, A., Cornu\u00e9jols, G., Grossmann, I., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization\u00a05, 186\u2013204 (2008)","journal-title":"Discrete Optimization"},{"key":"10_CR4","unstructured":"BONMIN. projects.coin-or.org\/Bonmin (v. 1.0)"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/TPWRS.2008.926704","volume":"23","author":"A. Borghetti","year":"2008","unstructured":"Borghetti, A., D\u2019Ambrosio, C., Lodi, A., Martello, S.: An MILP approach for short-term hydro scheduling and unit commitment with head-dependent reservoir. IEEE Transactions on Power Systems\u00a023(3), 1115\u20131124 (2008)","journal-title":"IEEE Transactions on Power Systems"},{"key":"10_CR6","unstructured":"COUENNE. projects.coin-or.org\/Couenne (v. 0.1)"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","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. Mathematical Programming\u00a036(3), 307\u2013339 (1986)","journal-title":"Mathematical Programming"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","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. Mathematical Programming\u00a066(1), 327\u2013349 (1994)","journal-title":"Mathematical Programming"},{"key":"10_CR9","unstructured":"Fourer, R., Gay, D., Kernighan, B.: AMPL: A Modeling Language for Mathematical Programming. 2nd edn. Duxbury Press\/Brooks\/Cole Publishing Co. (2003)"},{"key":"10_CR10","unstructured":"G\u00fcnl\u00fck, O., Lee, J., Weismantel, R.: MINLP strengthening for separable convex quadratic transportation-cost UFL, IBM Research Report RC24213 (2007)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/0-387-30528-9_8","volume-title":"Global Optimization: From Theory to Implementation","author":"L. Liberti","year":"2006","unstructured":"Liberti, L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 211\u2013262. Springer, Heidelberg (2006)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-39901-8_3","volume-title":"Global Optimization and Constraint Satisfaction","author":"I. Nowak","year":"2003","unstructured":"Nowak, I., Alperin, H., Vigerske, S.: LaGO \u2013 an object oriented library for solving MINLPs. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) COCOS 2002. LNCS, vol.\u00a02861, pp. 32\u201342. Springer, Heidelberg (2003)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I. Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comp. & Chem. Eng.\u00a016, 937\u2013947 (1992)","journal-title":"Comp. & Chem. Eng."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N. Sahinidis","year":"1996","unstructured":"Sahinidis, N.: BARON: A general purpose global optimization software package. J. Global Opt.\u00a08, 201\u2013205 (1996)","journal-title":"J. Global Opt."},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming\u00a0106(1), 25\u201357 (2006)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:34:42Z","timestamp":1552160082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}