{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T19:09:43Z","timestamp":1789931383251,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642381706","type":"print"},{"value":"9783642381713","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_26","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"355-361","source":"Crossref","is-referenced-by-count":7,"title":["Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming"],"prefix":"10.1007","author":[{"given":"Ambros M.","family":"Gleixner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","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., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht Boston London (2002)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1021\/ie00015a012","volume":"32","author":"I. Quesada","year":"1993","unstructured":"Quesada, I., Grossmann, I.E.: Global optimization algorithm for heat exchanger networks. Industrial & Engineering Chemistry Research\u00a032(3), 487\u2013499 (1993), doi:10.1021\/ie00015a012","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01106605","volume":"6","author":"I. Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.E.: A global optimization algorithm for linear fractional and bilinear programs. Journal of Global Optimization\u00a06, 39\u201376 (1995), doi:10.1007\/BF01106605","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"C.D. Maranas","year":"1997","unstructured":"Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Computers & Chemical Engineering\u00a021(4), 351\u2013369 (1997), doi:10.1016\/S0098-1354(96)00282-7","journal-title":"Computers & Chemical Engineering"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E.M. Smith","year":"1999","unstructured":"Smith, E.M., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering\u00a023, 457\u2013478 (1999), doi:10.1016\/S0098-1354(98)00286-5","journal-title":"Computers & Chemical Engineering"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"J.M. Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. Journal of Global Optimization\u00a014, 217\u2013249 (1999), doi:10.1023\/A:1008312714792","journal-title":"Journal of Global Optimization"},{"issue":"9","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"C.S. Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014II. Implementation and computational results. Computers & Chemical Engineering\u00a022(9), 1159\u20131179 (1998), doi:10.1016\/S0098-1354(98)00218-X","journal-title":"Computers & Chemical Engineering"},{"issue":"9","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"C.S. Adjiman","year":"2000","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed-integer nonlinear problems. AIChE Journal\u00a046(9), 1769\u20131797 (2000), doi:10.1002\/aic.690460908","journal-title":"AIChE Journal"},{"key":"26_CR9","doi-asserted-by":"publisher","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. Optimization Methods & Software\u00a024, 597\u2013634 (2009), doi:10.1080\/10556780903087124","journal-title":"Optimization Methods & Software"},{"key":"26_CR10","unstructured":"COIN-OR: Couenne. Convex Over and Under ENvelopes for Nonlinear Estimation, \n                    http:\/\/www.coin-or.org\/Couenne"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: Global mixed-integer quadratic optimizer. Journal of Global Optimization, 1\u201348 (2012), doi:10.1007\/s10898-012-9874-7","DOI":"10.1007\/s10898-012-9874-7"},{"key":"26_CR12","unstructured":"Computer-Aided Systems Laboratory, Princeton University: GloMIQO. Global Mixed-Integer Quadratic Optimizer, \n                    http:\/\/helios.princeton.edu\/GloMIQO"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10100-007-0051-x","volume":"16","author":"I. Nowak","year":"2008","unstructured":"Nowak, I., Vigerske, S.: LaGO: a (heuristic) branch and cut algorithm for nonconvex MINLPs. Central European Journal of Operations Research\u00a016(2), 127\u2013138 (2008), doi:10.1007\/s10100-007-0051-x","journal-title":"Central European Journal of Operations Research"},{"key":"26_CR14","unstructured":"COIN-OR: LaGO Lagrangian Global Optimizer, \n                    http:\/\/www.coin-or.org\/LaGO"},{"key":"26_CR15","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, TU Berlin (2007), \n                    http:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/1018"},{"key":"26_CR16","unstructured":"Vigerske, S.: Decomposition in Multistage Stochastic Programming and a Constraint Integer Programming Approach to MINLP. PhD thesis, HU Berlin (2012)"},{"key":"26_CR17","unstructured":"Zuse Institute Berlin, Department of Optimization: SCIP. Solving Constraint Integer Programs, \n                    http:\/\/scip.zib.de"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-008-0263-4","volume":"125","author":"A. Caprara","year":"2010","unstructured":"Caprara, A., Locatelli, M.: Global optimization problems and domain reduction strategies. Mathematical Programming\u00a0125, 123\u2013137 (2010), doi:10.1007\/s10107-008-0263-4","journal-title":"Mathematical Programming"},{"key":"26_CR19","doi-asserted-by":"publisher","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. Mathematical Programming\u00a099, 563\u2013591 (2004), doi:10.1007\/s10107-003-0467-6","journal-title":"Mathematical Programming"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., Vigerske, S.: Extending a CIP framework to solve MIQCPs. In: Lee, J., Leyffer, S. (eds.) Mixed41-Integer Nonlinear Optimization. The IMA volumes in Mathematics and its Applications, vol.\u00a0154, pp. 427\u2013444. Springer (2012), doi:10.1007\/978-1-4614-1927-3_15","DOI":"10.1007\/978-1-4614-1927-3_15"},{"issue":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"M. Bussieck","year":"2003","unstructured":"Bussieck, M., Drud, A., Meeraus, A.: MINLPLib \u2013 a collection of test models for mixed-integer nonlinear programming. INFORMS J. on Comput.\u00a015(1), 114\u2013119 (2003)","journal-title":"INFORMS J. on Comput."},{"key":"26_CR22","unstructured":"IBM: ILOG CPLEX Optimizer, \n                    http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"26_CR23","unstructured":"COIN-OR: CppAD. A Package for Differentiation of C++ Algorithms. \n                    http:\/\/www.coin-or.org\/CppAD"},{"issue":"1","key":"26_CR24","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. Math. Prog.\u00a0106(1), 25\u201357 (2006)","journal-title":"Math. Prog."},{"key":"26_CR25","unstructured":"COIN-OR: Ipopt. Interior point optimizer, \n                    http:\/\/www.coin-or.org\/Ipopt"},{"key":"26_CR26","unstructured":"Gleixner, A.M., Weltge, S.: Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming. ZIB-Report 13-04, Zuse Institute Berlin (2013), \n                    http:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/1763"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:09:52Z","timestamp":1609204192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}