{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T19:34:46Z","timestamp":1776281686813,"version":"3.50.1"},"reference-count":202,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,1,14]],"date-time":"2017-01-14T00:00:00Z","timestamp":1484352000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10601-016-9267-5","type":"journal-article","created":{"date-parts":[[2017,1,14]],"date-time":"2017-01-14T09:07:28Z","timestamp":1484384848000},"page":"338-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":68,"title":["Domain reduction techniques for global NLP and MINLP optimization"],"prefix":"10.1007","volume":"22","author":[{"given":"Yash","family":"Puranik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,14]]},"reference":[{"key":"9267_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T. (2007). Conflict analysis in mixed integer programming. Discrete Optimization, 4, 4\u201320.","journal-title":"Discrete Optimization"},{"key":"9267_CR2","volume-title":"Constraint Integer Programming","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). Constraint Integer Programming. Berlin: Ph.D. thesis, Technische Universit\u00e4t."},{"key":"9267_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation, 1, 1\u201341.","journal-title":"Mathematical Programming Computation"},{"key":"9267_CR4","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., & Weninger, D. (2014). Multi-row presolve reductions in mixed integer programming. In Proceedings of the Twenty-Sixth RAMP Symposium. Hosei University, Tokyo."},{"key":"9267_CR5","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Sabharwal, A., & Samulowitz, H. (2013). Stronger inference through implied literals from conflicts and knapsack covers. In Gomes, C., & Sellmann, M. (Eds.) Proceedings of 10th International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 1\u201311). Berlin: Springer.","DOI":"10.1007\/978-3-642-38171-3_1"},{"key":"9267_CR6","unstructured":"Achterberg, T., & Wunderling, R. (2013). Mixed integer programming: Analyzing 12 years of progress. In J\u00fcnger, M., & Reinelt, G. (Eds.) Facets of Combinatorial Optimization (pp. 449\u2013481). Berlin: Springer."},{"key":"9267_CR7","unstructured":"AIMMS: AIMMS Modeling Language (2015). http:\/\/www.aimms.com\/ ."},{"key":"9267_CR8","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/S105262349935178X","volume":"10","author":"FA Al-Khayyal","year":"2000","unstructured":"Al-Khayyal, F.A., & Sherali, H.D. (2000). On finitely terminating branch-and-bound algorithms for some global optimization problems. SIAM Journal on Optimization, 10, 1049\u20131057.","journal-title":"SIAM Journal on Optimization"},{"key":"9267_CR9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/s11750-011-0178-8","volume":"20","author":"S Amaran","year":"2012","unstructured":"Amaran, S., & Sahinidis, N.V. (2012). Global optimization of nonlinear least-squares problems by branch-and-bound and optiMality constraints. TOP, 20, 154\u2013172.","journal-title":"TOP"},{"key":"9267_CR10","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/0098-1354(92)80011-W","volume":"16","author":"RJ Amarger","year":"1992","unstructured":"Amarger, R.J., Biegler, L.T., & Grossmann, I.E. (1992). An automated modelling and reformulation system for design optimization. Computers & Chemical Engineering, 16, 623\u2013636.","journal-title":"Computers & Chemical Engineering"},{"key":"9267_CR11","unstructured":"AMPL: AMPL Modeling Language. http:\/\/www.ampl.com\/."},{"key":"9267_CR12","first-page":"221","volume":"71","author":"DE Andersen","year":"1995","unstructured":"Andersen, D.E., & Andersen, K.D. (1995). Presolving in linear programming. Mathematical Programming, 71, 221\u2013245.","journal-title":"Mathematical Programming"},{"key":"9267_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10107-008-0243-8","volume":"122","author":"K Andersen","year":"2010","unstructured":"Andersen, K., & Pochet, Y. (2010). Coefficient strengthening: A tool for reformulating mixed-integer programs. Mathematical programming, 122, 121\u2013154.","journal-title":"Mathematical programming"},{"key":"9267_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"KR Apt","year":"1999","unstructured":"Apt, K.R. (1999). The essence of constraint propagation. Theoretical computer science, 221, 179\u2013210.","journal-title":"Theoretical computer science"},{"key":"9267_CR15","unstructured":"Araya, I., & Reyes, V. (2015). Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: A survey and prospects. Journal of Global Optimization, 1\u201330."},{"key":"9267_CR16","doi-asserted-by":"crossref","first-page":"8086","DOI":"10.1016\/j.eswa.2015.06.030","volume":"42","author":"I Araya","year":"2015","unstructured":"Araya, I., Soto, R., & Crawford, B. (2015). Adaptive filtering strategy for numerical constraint satisfaction problems. Expert Systems with Applications, 42, 8086\u20138094.","journal-title":"Expert Systems with Applications"},{"key":"9267_CR17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., & Savelsbergh, M.W.P. (2000). Conflict graphs in solving integer programming problems. European Journal of Operational Research, 121, 40 \u201355.","journal-title":"European Journal of Operational Research"},{"key":"9267_CR18","doi-asserted-by":"crossref","unstructured":"Balakrishnan, V., & Boyd, S. (1992). Global optimization in control system analysis and design. In Leondes, C.T. (Ed.) Control and Dynamic Systems, Advances in Theory and Applications. New York: Academic Press.","DOI":"10.1016\/B978-0-12-012753-5.50006-5"},{"key":"9267_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-014-0073-z","volume":"7","author":"X Bao","year":"2015","unstructured":"Bao, X., Khajavirad, A., Sahinidis, N.V., & Tawarmalani, M. (2015). Global optimization of nonconvex problems with multilinear intermediates. Mathematical Programming Computation, 7, 1\u201337.","journal-title":"Mathematical Programming Computation"},{"key":"9267_CR20","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., & Tawarmalani, M. (2009). Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optimization Methods and Software, 24, 485\u2013 504.","journal-title":"Optimization Methods and Software"},{"key":"9267_CR21","unstructured":"BARON. http:\/\/minlp.com\/baron ."},{"key":"9267_CR22","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s10898-012-9848-9","volume":"56","author":"P Belotti","year":"2013","unstructured":"Belotti, P. (2013). Bound reduction using pairs of linear inequalities. Journal of Global Optimization, 56, 787\u2013819.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR23","doi-asserted-by":"crossref","unstructured":"Belotti, P., Cafieri, S., Lee, J., & Liberti, L. (2010). Feasibility-based bounds tightening via fixed points. In Wu, W., & Daescu, O. (Eds.) Combinatorial Optimization and Applications (pp. 65\u201376). Berlin: Springer.","DOI":"10.1007\/978-3-642-17458-2_7"},{"key":"9267_CR24","unstructured":"Belotti, P., Cafieri, S., Lee, J., & Liberti, L. (2012). On feasibility based bounds tightening. http:\/\/www.optimization-online.org\/DB_HTML\/2012\/01\/3325.html ."},{"key":"9267_CR25","doi-asserted-by":"crossref","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. (2009). Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software, 24, 597\u2013634.","journal-title":"Optimization Methods and Software"},{"key":"9267_CR26","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., & Puget, J. (1999). Revising hull and box consistency. In Proceedings of the 1999 International Conference on Logic Programming, pp. 230\u2013244. Massachusetts Institute of Technology."},{"key":"9267_CR27","unstructured":"Benhamou, F., McAllester, D., & Hentenryck, P.V. (1994). CLP (intervals) revisited. In Bruynooghe, M. (Ed.) Proceedings of the 1994 International Symposium on Logic programming (pp. 124\u2013138). Cambridge: MIT Press."},{"key":"9267_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F Benhamou","year":"1997","unstructured":"Benhamou, F., & Older, W.J. (1997). Applying interval arithmetic to real, integer, and boolean constraints. The Journal of Logic Programming, 32, 1\u201324.","journal-title":"The Journal of Logic Programming"},{"key":"9267_CR29","unstructured":"Bessiere, C. (2006). Walsh Constraint propagation. In Rossi, F., van, P., & Beek, T. (Eds.) Handbook of Constraint Programming, chap. 2 (pp. 29\u201383). Amsterdam: Elsevier."},{"key":"9267_CR30","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.artint.2007.10.016","volume":"172","author":"C Bessiere","year":"2008","unstructured":"Bessiere, C., Stergiou, K., & Walsh, T. (2008). Domain filtering consistencies for non-binary constraints. Artificial Intelligence, 172, 800\u2013822.","journal-title":"Artificial Intelligence"},{"key":"9267_CR31","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R Bixby","year":"2007","unstructured":"Bixby, R., & Rothberg, E. (2007). Progress in computational mixed integer programming\u2013a look back from the other side of the tipping point. Annals of Operations Research, 149, 37\u201341.","journal-title":"Annals of Operations Research"},{"key":"9267_CR32","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., Hamadi, Y., & Vardi, M.Y. (2007). An analysis of slow convergence in interval propagation. In Bessiere, C. (Ed.) Principles and Practice of Constraint Programming\u2013CP 2007 (pp. 790\u2013797). Berlin: Springer-Verlag.","DOI":"10.1007\/978-3-540-74970-7_56"},{"key":"9267_CR33","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1613\/jair.3248","volume":"40","author":"L Bordeaux","year":"2011","unstructured":"Bordeaux, L., Katsirelos, G., Narodytska, N., & Vardi, M.Y. (2011). The complexity of integer bound propagation. Journal of Artificial Intelligence Research, 40, 657\u2013676.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9267_CR34","doi-asserted-by":"crossref","unstructured":"Borradaile, G., & van Hentenryck, P. (2005). Safe and tight linear estimators for global optimization. Mathematical Programming, 102, 495\u2013517.","DOI":"10.1007\/s10107-004-0533-8"},{"key":"9267_CR35","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"AL Brearley","year":"1975","unstructured":"Brearley, A.L., Mitra, G., & Williams, H.P. (1975). Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical programming, 8, 54\u201383.","journal-title":"Mathematical programming"},{"key":"9267_CR36","doi-asserted-by":"crossref","unstructured":"Brooke, A., Kendrick, D., & Meeraus, A. (1988). GAMS\u2013A User\u2019s Guide. The Scientific Press, Redwood City CA.","DOI":"10.1145\/58859.58863"},{"key":"9267_CR37","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s10589-009-9273-2","volume":"48","author":"S Burer","year":"2011","unstructured":"Burer, S., & Chen, J. (2011). Relaxing the optiMality conditions of box QP. Computational Optimization and Applications, 48, 653\u2013673.","journal-title":"Computational Optimization and Applications"},{"key":"9267_CR38","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., & Vandenbussche, D. (2008). A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Mathematical Programming, 113, 259\u2013282.","journal-title":"Mathematical Programming"},{"key":"9267_CR39","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S Burer","year":"2009","unstructured":"Burer, S., & Vandenbussche, D. (2009). Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Computational Optimization and Applications, 43, 181\u2013195.","journal-title":"Computational Optimization and Applications"},{"key":"9267_CR40","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., & Meeraus, A. (2003). MINLPLib\u2013A collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing, 15, 114\u2013119.","journal-title":"INFORMS Journal on Computing"},{"key":"9267_CR41","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-008-0263-4","volume":"125","author":"A Caprara","year":"2010","unstructured":"Caprara, A., & Locatelli, M. (2010). Global optimization problems and domain reduction strategies. Mathematical Programming, 125, 123\u2013137.","journal-title":"Mathematical Programming"},{"key":"9267_CR42","doi-asserted-by":"crossref","unstructured":"Caprara, A., Locatelli, M., & Monaci, M. (2016). Theoretical and computational results about optiMality-based domain reductions. Computational Optimization and Applications, 1\u201321.","DOI":"10.1007\/s10589-015-9818-5"},{"key":"9267_CR43","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10898-014-0162-6","volume":"59","author":"PM Castro","year":"2014","unstructured":"Castro, P.M., & Grossmann, I.E. (2014). OptiMality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems. Journal of Global Optimization, 59, 277\u2013306.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR44","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.energy.2010.10.014","volume":"36","author":"JPS Catal\u00e3o","year":"2011","unstructured":"Catal\u00e3o, J.P.S., Pousinho, H.M.I., & Mendes, V.M.F. (2011). Hydro energy systems management in Portugal: Profit-based evaluation of a mixed-integer nonlinear approach. Energy, 36, 500\u2013507.","journal-title":"Energy"},{"key":"9267_CR45","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., & Burer, S. (2012). Globally solving nonconvex quadratic programming problems via completely positive programming. Mathematical Programming Computation, 4, 33\u201352.","journal-title":"Mathematical Programming Computation"},{"key":"9267_CR46","volume-title":"Feasibility and infeasibility in optimization","author":"JW Chinneck","year":"2008","unstructured":"Chinneck, J.W. (2008). Feasibility and infeasibility in optimization. New York: Springer."},{"key":"9267_CR47","first-page":"125","volume":"2","author":"JG Cleary","year":"1987","unstructured":"Cleary, J.G. (1987). Logical arithmetic. Future computing systems, 2, 125\u2013149.","journal-title":"Future computing systems"},{"key":"9267_CR48","unstructured":"CMU-IBM open source MINLP project test set. http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm ."},{"key":"9267_CR49","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1009922003700","volume":"5","author":"H Collavizza","year":"1999","unstructured":"Collavizza, H., Delobel, F., & Rueher, M. (1999). Comparing partial consistencies. Reliable computing, 5, 213\u2013228.","journal-title":"Reliable computing"},{"key":"9267_CR50","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF02242276","volume":"33","author":"H Cornelius","year":"1984","unstructured":"Cornelius, H., & Lohner, R. (1984). Computing the range of values of real functions with accuracy higher than second order. Computing, 33, 331\u2013347.","journal-title":"Computing"},{"key":"9267_CR51","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., & Padberg, M. (1983). Solving large-scale zero-one linear programming problems. Operations Research, 31, 803\u2013834.","journal-title":"Operations Research"},{"key":"9267_CR52","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M., & Mor\u00e9, J. (1998). The NEOS server. IEEE Computational Science andamp; Engineering, 5, 68\u201375.","journal-title":"IEEE Computational Science andamp; Engineering"},{"key":"9267_CR53","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.ejor.2014.12.039","volume":"243","author":"C D\u2019Ambrosio","year":"2015","unstructured":"D\u2019Ambrosio, C., Lodi, A., Wiese, S., & Bragalli, C. (2015). Mathematical programming techniques in water network optimization. European Journal of Operational Research, 243, 774\u2013788.","journal-title":"European Journal of Operational Research"},{"key":"9267_CR54","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E Davis","year":"1987","unstructured":"Davis, E. (1987). Constraint propagation with interval labels. Artificial intelligence, 32, 281\u2013331.","journal-title":"Artificial intelligence"},{"key":"9267_CR55","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-014-0851-4","volume":"155","author":"F Domes","year":"2016","unstructured":"Domes, F., & Neumaier, A. (2016). Constraint aggregation for rigorous global optimization. Mathematical Programming, 155, 375\u2013401.","journal-title":"Mathematical Programming"},{"key":"9267_CR56","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01096455","volume":"5","author":"K Du","year":"1994","unstructured":"Du, K., & Kearfott, R.B. (1994). The cluster problem in multivariate global optimization. Journal of Global Optimization, 5, 253\u2013265.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR57","unstructured":"Edelkamp, S., & Schroedl, S. (2011). Heuristic search: Theory and applications Elsevier."},{"key":"9267_CR58","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"JE Falk","year":"1969","unstructured":"Falk, J.E., & Soland, R.M. (1969). An algorithm for separable nonconvex programming problems. Management Science, 15, 550\u2013569.","journal-title":"Management Science"},{"key":"9267_CR59","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0004-3702(94)90022-1","volume":"65","author":"B Faltings","year":"1994","unstructured":"Faltings, B. (1994). Arc-consistency for continuous variables. Artificial intelligence, 65, 363\u2013376.","journal-title":"Artificial intelligence"},{"key":"9267_CR60","doi-asserted-by":"crossref","first-page":"3738","DOI":"10.1021\/ie101206c","volume":"50","author":"DC Faria","year":"2011","unstructured":"Faria, D.C., & Bagajewicz, M.J. (2011). Global optimization of water management problems using linear relaxation and bound contraction methods. Industrial & Engineering Chemistry Research, 50, 3738\u20133753.","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"9267_CR61","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.compchemeng.2010.04.010","volume":"35","author":"DC Faria","year":"2011","unstructured":"Faria, D.C., & Bagajewicz, M.J. (2011). Novel bound contraction procedure for global optimization of bilinear MINLP problems with applications to water management problems. Computers & Chemical Engineering, 35, 446\u2013455.","journal-title":"Computers & Chemical Engineering"},{"key":"9267_CR62","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1002\/aic.12754","volume":"58","author":"DC Faria","year":"2012","unstructured":"Faria, D.C., & Bagajewicz, M.J. (2012). A new approach for global optimization of a class of MINLP problems with applications to water management and pooling problems. AIChE Journal, 58, 2320\u20132335.","journal-title":"AIChE Journal"},{"key":"9267_CR63","doi-asserted-by":"crossref","unstructured":"Ferris, M.C., & Munson, T.S. (2001). Preprocessing complementarity problems. In Ferris, M.C., Mangasarian, O.L., & Pang, J. (Eds.) Complementarity: Applications, Algorithms and Extensions (pp. 143\u2013164). Dordrecht: Springer.","DOI":"10.1007\/978-1-4757-3279-5_7"},{"key":"9267_CR64","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.1090.0329","volume":"22","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., & Salvagnin, D. (2010). Pruning moves. INFORMS Journal on Computing, 22, 108\u2013119.","journal-title":"INFORMS Journal on Computing"},{"key":"9267_CR65","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(88)90025-9","volume":"7","author":"M Fischetti","year":"1988","unstructured":"Fischetti, M., & Toth, P. (1988). A new dominance procedure for combinatorial optimization problems. Operations Research Letters, 7, 181\u2013187.","journal-title":"Operations Research Letters"},{"key":"9267_CR66","doi-asserted-by":"crossref","unstructured":"Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering. In Jaffar, J. (Ed.) Proceedings of Principles and Practice of Constraint Programming: 5th International Conference (pp. 189\u2013203). Berlin: Springer.","DOI":"10.1007\/978-3-540-48085-3_14"},{"key":"9267_CR67","doi-asserted-by":"crossref","unstructured":"Fourer, R., & Gay, D.M. (1994). Experience with a primal presolve algorithm. In Hager, W., Hearn, D., & Pardalos, P. (Eds.) Large Scale Optimization: State of the Art (pp. 135\u2013154). Boston: Springer.","DOI":"10.1007\/978-1-4613-3632-7_8"},{"key":"9267_CR68","unstructured":"F\u00fcgenschuh, A., Homfeld, H., Sch\u00fclldorf, H., & Vigerske, S. (2010). Mixed-integer nonlinear problems in transportation applications. In Proceedings of the 2nd International Conference on Engineering Optimization (CD-ROM) (p. 14)."},{"key":"9267_CR69","doi-asserted-by":"crossref","first-page":"2335","DOI":"10.1021\/ie010389e","volume":"41","author":"KC Furman","year":"2002","unstructured":"Furman, K.C., & Sahinidis, N.V. (2002). A critical review and annotated bibliography for heat exchanger network synthesis in the 20th century. Industrial & Engineering Chemistry Research, 41, 2335\u20132370.","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"9267_CR70","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s12532-015-0083-5","volume":"7","author":"G Gamrath","year":"2015","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., & Weninger, D. (2015). Progress in presolving for mixed integer programming. Mathematical Programming Computation, 7, 367\u2013398.","journal-title":"Mathematical Programming Computation"},{"key":"9267_CR71","unstructured":"Gleixner, A.M., Berthold, T., M\u00fcller, B., & Weltge, S. (2016). Three enhancements for optimization-based bound tightening. ZIB Report, 15\u201316."},{"key":"9267_CR72","doi-asserted-by":"crossref","unstructured":"Gleixner, A.M., & Weltge, S. (2013). Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming. In Proceedings of 10th International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 355\u2013361). Berlin: Springer.","DOI":"10.1007\/978-3-642-38171-3_26"},{"key":"9267_CR73","unstructured":"GLOBAL Library. http:\/\/www.gamsworld.org\/global\/globallib.htm ."},{"key":"9267_CR74","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","volume":"9","author":"J Gondzio","year":"1997","unstructured":"Gondzio, J. (1997). Presolve analysis of linear programs prior to applying an interior point method. INFORMS Journal on Computing, 9, 73\u201391.","journal-title":"INFORMS Journal on Computing"},{"key":"9267_CR75","first-page":"95","volume":"100","author":"N Gould","year":"2004","unstructured":"Gould, N., & Toint, P.L. (2004). Preprocessing for quadratic programming. Mathematical Programming, 100, 95\u2013132.","journal-title":"Mathematical Programming"},{"key":"9267_CR76","doi-asserted-by":"crossref","first-page":"1846","DOI":"10.1002\/aic.10617","volume":"51","author":"I Grossmann","year":"2005","unstructured":"Grossmann, I. (2005). Enterprise-wide optimization: A new frontier in process systems engineering. AIChE Journal, 51, 1846\u20131857.","journal-title":"AIChE Journal"},{"key":"9267_CR77","first-page":"263","volume":"30","author":"IE Grossmann","year":"2000","unstructured":"Grossmann, I.E., Caballero, J.A., & Yeomans, H. (2000). Advances in mathematical programming for the synthesis of process systems. Latin American Applied Research, 30, 263\u2013284.","journal-title":"Latin American Applied Research"},{"key":"9267_CR78","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M Guignard","year":"1981","unstructured":"Guignard, M., & Spielberg, K. (1981). Logical reduction methods in zero-one programming-minimal preferred variables. Operations Research, 29, 49\u201374.","journal-title":"Operations Research"},{"key":"9267_CR79","first-page":"169","volume":"3","author":"GD Hager","year":"1993","unstructured":"Hager, G.D. (1993). Solving large systems of nonlinear constraints with application to data modeling. Interval Computations, 3, 169\u2013200.","journal-title":"Interval Computations"},{"key":"9267_CR80","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01100238","volume":"3","author":"ASE Hamed","year":"1993","unstructured":"Hamed, A.S.E., & McCormick, G.P. (1993). Calculation of bounds on variables satisfying nonlinear inequality constraints. Journal of Global Optimization, 3, 25\u201347.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR81","unstructured":"Hansen, E.R. (1992). Global optimization using interval analysis. Pure and Applied Mathematics."},{"key":"9267_CR82","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01582889","volume":"52","author":"P Hansen","year":"1991","unstructured":"Hansen, P., Jaumard, B., & Lu, S.H. (1991). An analytic approach to global optimization. Mathematical Programming, 52, 227\u2013254.","journal-title":"Mathematical Programming"},{"key":"9267_CR83","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Ruiz, M., & Xiong, J. (1993). Global minimization of indefinite quadratic functions subject to box constraints. Naval Research Logistics (NRL), 40, 373\u2013392.","journal-title":"Naval Research Logistics (NRL)"},{"key":"9267_CR84","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I Harjunkoski","year":"1998","unstructured":"Harjunkoski, I., Westerlund, T., P\u00f6rn, R., & Skrifvars, H. (1998). Different transformations for solving non-convex trim-loss problems by MINLP. European Journal of Operational Research, 105, 594\u2013 603.","journal-title":"European Journal of Operational Research"},{"key":"9267_CR85","unstructured":"Harvey, W., & Schimpf, J. (2002). Bounds consistency techniques for long linear constraints. In Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems (pp. 39\u201346)."},{"key":"9267_CR86","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/s10601-012-9136-9","volume":"18","author":"S Heinz","year":"2013","unstructured":"Heinz, S., Schulz, J., & Beck, J.C. (2013). Using dual presolving reductions to reformulate cumulative constraints. Constraints, 18, 166\u2013201.","journal-title":"Constraints"},{"key":"9267_CR87","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"KL Hoffman","year":"1991","unstructured":"Hoffman, K.L., & Padberg, M. (1991). Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing, 3, 121\u2013134.","journal-title":"ORSA Journal on Computing"},{"key":"9267_CR88","volume-title":"Integrated methods for optimization","author":"JN Hooker","year":"2007","unstructured":"Hooker, J.N. (2007). Integrated methods for optimization. New York: Springer Science & Business Media."},{"key":"9267_CR89","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., & Tuy, H. (1996). Global Optimization: Deterministic Approaches, 3rd edn. Berlin: Springer Verlag.","edition":"3rd edn."},{"key":"9267_CR90","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10107-010-0426-y","volume":"133","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., & Pang, J. (2012). An LPCC approach to nonconvex quadratic programs. Mathematical programming, 133, 243\u2013277.","journal-title":"Mathematical programming"},{"key":"9267_CR91","unstructured":"Hunting, M. (2011). A nonlinear presolve algorithm in AIMMS, An AIMMS white paper, Paragon Decision Technology, BV."},{"key":"9267_CR92","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","volume":"24","author":"T Ibaraki","year":"1977","unstructured":"Ibaraki, T. (1977). The power of dominance relations in branch-and-bound algorithms. Journal of the ACM, 24, 264\u2013279.","journal-title":"Journal of the ACM"},{"key":"9267_CR93","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02284625","volume":"17","author":"J Imbert","year":"1996","unstructured":"Imbert, J., & Hentenryck, P.V. (1996). Redundancy elimination with a lexicographic solved form. Annals of Mathematics and Artificial Intelligence, 17, 85\u2013106.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9267_CR94","doi-asserted-by":"crossref","first-page":"4475","DOI":"10.1021\/ie901632w","volume":"49","author":"J Jezowski","year":"2010","unstructured":"Jezowski, J. (2010). Review of water network design methods with literature annotations. Industrial & Engineering Chemistry Research, 49, 4475\u20134516.","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"9267_CR95","volume-title":"Minima of functions of several variables with inequalities as side constraints","author":"W Karush","year":"1939","unstructured":"Karush, W. (1939). Minima of functions of several variables with inequalities as side constraints. Chicago, IL: Master\u2019s thesis, Department of Mathematics, University of Chicago."},{"key":"9267_CR96","volume-title":"Nogood processing in CSPs","author":"G Katsirelos","year":"2008","unstructured":"Katsirelos, G. (2008). Nogood processing in CSPs. Ph.D. thesis: University of Toronto."},{"key":"9267_CR97","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02253433","volume":"47","author":"RB Kearfott","year":"1991","unstructured":"Kearfott, R.B. (1991). Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems. Computing, 47, 169\u2013191.","journal-title":"Computing"},{"key":"9267_CR98","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search: Continuous Problems, Nonconvex Optimization and Its Applications, Vol. 13","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B. (1996). Rigorous Global Search: Continuous Problems, Nonconvex Optimization and Its Applications Vol. 13. Dordrecht: Kluwer Academic Publishers."},{"key":"9267_CR99","doi-asserted-by":"crossref","unstructured":"Kearfott R.B. (2009). GlobSol user guide. Optimization Methods and Software, 24, 687\u2013708.","DOI":"10.1080\/10556780802614051"},{"key":"9267_CR100","unstructured":"Kell, B., Sabharwal, A., & van Hoeve, W. (2015). BDD-guided clause generation. In Michel, L. (Ed.) Integration of AI and OR Techniques in Constraint Programming (pp. 215\u2013230): Springer."},{"key":"9267_CR101","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107-012-0618-8","volume":"144","author":"A Khajavirad","year":"2014","unstructured":"Khajavirad, A., Michalek, J.J., & Sahinidis, N.V. (2014). Relaxations of factorable functions with convex-transformable intermediates. Mathematical Programming, 144, 107\u2013140.","journal-title":"Mathematical Programming"},{"key":"9267_CR102","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10898-011-9747-5","volume":"52","author":"A Khajavirad","year":"2011","unstructured":"Khajavirad, A., & Sahinidis, N.V. (2011). Convex envelopes of products of convex and component-wise concave functions. Journal of Global Optimization, 52, 391\u2013409.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR103","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-011-0496-5","volume":"137","author":"A Khajavirad","year":"2013","unstructured":"Khajavirad, A., & Sahinidis, N.V. (2013). Convex envelopes generated from finitely many compact convex sets. Mathematical Programming, 137, 371\u2013408.","journal-title":"Mathematical Programming"},{"key":"9267_CR104","unstructured":"K\u0131l\u0131n\u00e7, M., & Sahinidis, N.V. (2014). Solving MINLPs with BARON. Presented at MINLP Workshop, Pittsburgh http:\/\/http:\/\/minlp.cheme.cmu.edu\/2014\/papers\/kilinc.pdf ."},{"key":"9267_CR105","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/321796.321808","volume":"21","author":"WH Kohler","year":"1974","unstructured":"Kohler, W.H., & Steiglitz, K. (1974). Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. Journal of the ACM, 21, 140\u2013156.","journal-title":"Journal of the ACM"},{"key":"9267_CR106","unstructured":"Kuhn, H.W., & Tucker, A.W. (1951). Nonlinear programming. In Neyman, J. (Ed.) Proceedings ofthe Second Berkeley Symposium on Mathematical Statistics and Probability (pp. 481\u2013492). Berkeley: University of California Press."},{"key":"9267_CR107","doi-asserted-by":"crossref","unstructured":"Kulisch, U.W. (2009). Complete interval arithmetic and its implementation on the computer. In Cuyt, A., Kr\u00e4mer, W., Luther, W., & Markstein, P. (Eds.) Numerical Validation in Current Hardware Architectures. Berlin: Springer.","DOI":"10.1007\/978-3-642-01591-5_2"},{"key":"9267_CR108","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01096771","volume":"3","author":"BW Lamar","year":"1993","unstructured":"Lamar, B.W. (1993). An improved branch and bound algorithm for minimum concave cost network flow problems. Journal of Global Optimization, 3, 261\u2013287.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR109","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., & Doig, A.G. (1960). An automatic method for solving discrete programming problems. Econometrica, 28, 497\u2013520.","journal-title":"Econometrica"},{"key":"9267_CR110","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1080\/10556780902753452","volume":"24","author":"Y Lebbah","year":"2009","unstructured":"Lebbah, Y. (2009). ICOS: A branch and bound based solver for rigorous global optimization. Optimization Methods and Software, 24, 709\u2013726.","journal-title":"Optimization Methods and Software"},{"key":"9267_CR111","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10601-004-5307-7","volume":"10","author":"Y Lebbah","year":"2005","unstructured":"Lebbah, Y., Michel, C., & Rueher, M. (2005). A rigorous global filtering algorithm for quadratic constraints. Constraints, 10, 47\u201365.","journal-title":"Constraints"},{"key":"9267_CR112","doi-asserted-by":"crossref","unstructured":"Lebbah, Y., Michel, C., & Rueher, M. (2007). Using constraint techniques for a safe and fast implementation of optiMality-based reduction. In Proceedings of the 2007 ACM symposium on Applied Computing (pp. 326\u2013331).","DOI":"10.1145\/1244002.1244079"},{"key":"9267_CR113","doi-asserted-by":"crossref","first-page":"2076","DOI":"10.1137\/S0036142903436174","volume":"42","author":"Y Lebbah","year":"2005","unstructured":"Lebbah, Y., Michel, C., Rueher, M., Daney, D., & Merlet, J.P. (2005). Efficient and safe global constraints for handling numerical constraint systems. SIAM Journal on Numerical Analysis, 42, 2076\u20132097.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"9267_CR114","doi-asserted-by":"crossref","first-page":"147","DOI":"10.3233\/SAT190009","volume":"1","author":"C Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sais, L., Tabary, S., & Vidal, V. (2007). Recording and minimizing nogoods from restarts. Journal on Satisfiability Boolean Modeling and Computation, 1, 147\u2013167.","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"9267_CR115","unstructured":"Leo, K., & Tack, G. (2015). Multi-Pass High-Level Presolving. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"key":"9267_CR116","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric CSPs. In International Joint Conference on Artificial Intelligence, (Vol. 93 pp. 232\u2013238)."},{"key":"9267_CR117","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., & Schrage, L. (2009). The global solver in the LINDO API. Optimization Methods and Software, 24, 657\u2013668.","journal-title":"Optimization Methods and Software"},{"key":"9267_CR118","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02022097","volume":"21","author":"WA Lodwick","year":"1989","unstructured":"Lodwick, W.A. (1989). Constraint propagation, relational arithmetic in AI systems and mathematical programs. Annals of Operations Research, 21, 143\u2013148.","journal-title":"Annals of Operations Research"},{"key":"9267_CR119","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/ijoc.4.2.119","volume":"4","author":"WA Lodwick","year":"1992","unstructured":"Lodwick, W.A. (1992). Preprocessing nonlinear constraints with applications to the pooling problem. ORSA Journal on Computing, 4, 119\u2013131.","journal-title":"ORSA Journal on Computing"},{"key":"9267_CR120","doi-asserted-by":"crossref","unstructured":"Lynce, I., & Marques-Silva, J. (2003). Probing-based preprocessing techniques for propositional satisfiability. In Proceedings of 15th ICTAI (pp. 105\u2013110).","DOI":"10.1109\/TAI.2003.1250177"},{"key":"9267_CR121","unstructured":"Mahajan, A. (2010). Presolving Mixed-Integer Linear Programs. In Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., & Smith, J.C. (Eds.) Wiley Encyclopedia of Operations Research and Management Science. New York: Wiley"},{"key":"9267_CR122","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01585657","volume":"32","author":"OL Mangasarian","year":"1985","unstructured":"Mangasarian, O.L., & McLinden, L. (1985). Simple bounds for solutions of monotone complementarity problems and convex programs. Mathematical Programming, 32, 32\u201340.","journal-title":"Mathematical Programming"},{"key":"9267_CR123","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F. (2002). Pruning by isomorphism in branch-and-cut. Mathematical Programming, 94, 71\u201390.","journal-title":"Mathematical Programming"},{"key":"9267_CR124","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F Margot","year":"2003","unstructured":"Margot, F. (2003). Exploiting orbits in symmetric ILP. Mathematical Programming, 98, 3\u201321.","journal-title":"Mathematical Programming"},{"key":"9267_CR125","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s10898-013-0139-x","volume":"60","author":"MC Mark\u00f3t","year":"2014","unstructured":"Mark\u00f3t, M.C., & Schichl, H. (2014). Bound constrained interval global optimization in the COCONUT Environment. Journal of Global Optimization, 60, 751\u2013776.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR126","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., & Sakallah, K.A. (1999). GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48, 506\u2013521.","journal-title":"IEEE Transactions on Computers"},{"key":"9267_CR127","unstructured":"Martin, A. (2001). General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In J\u00fcnger, M., & Naddef, D.s (Eds.) Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (pp. 1\u201325). Berlin: Springer."},{"key":"9267_CR128","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-005-0665-5","volume":"105","author":"A Martin","year":"2006","unstructured":"Martin, A., M\u00f6ller, M., & Moritz, S. (2006). Mixed integer models for the stationary case of gas network optimization. Mathematical programming, 105, 563\u2013582.","journal-title":"Mathematical programming"},{"key":"9267_CR129","doi-asserted-by":"crossref","unstructured":"Martin, P., & Shmoys, D.B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In Cunningham, H.W., McCormick, T.S., & Queyranne, M. (Eds.) International Conference on Integer Programming and Combinatorial Optimization (pp. 389\u2013403). Berlin: Springer.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"9267_CR130","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0377-0427(94)00089-J","volume":"60","author":"G Mayer","year":"1995","unstructured":"Mayer, G. (1995). Epsilon-inflation in verification algorithms. Journal of Computational and Applied Mathematics, 60, 147\u2013169.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"9267_CR131","doi-asserted-by":"crossref","unstructured":"McCormick, G.P. (1976). Computability of global solutions to factorable nonconvex programs: Part I\u2014Convex underestimating problems. Mathematical Programming, 10, 147\u2013175.","DOI":"10.1007\/BF01580665"},{"key":"9267_CR132","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1051\/ro:2004026","volume":"38","author":"F Messine","year":"2004","unstructured":"Messine, F. (2004). Deterministic global optimization using interval constraint propagation techniques. RAIRO-Operations Research, 38, 277\u2013293.","journal-title":"RAIRO-Operations Research"},{"key":"9267_CR133","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s00291-003-0130-x","volume":"25","author":"CS M\u00e9sz\u00e1ros","year":"2003","unstructured":"M\u00e9sz\u00e1ros, C.S., & Suhl, U.H. (2003). Advanced preprocessing techniques for linear and quadratic programming. OR Spectrum, 25, 575\u2013595.","journal-title":"OR Spectrum"},{"key":"9267_CR134","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., & Floudas, C.A. (2005). Convex envelopes for edge-concave functions. Mathematical programming, 103, 207\u2013224.","journal-title":"Mathematical programming"},{"key":"9267_CR135","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., & Floudas, C.A. (2014). ANTIGONE: Algorithms for coNTinuous\/Integer Global Optimization of Nonlinear Equations. Journal of Global Optimization, 59, 503\u2013526.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR136","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1080\/10556780500065366","volume":"21","author":"HD Mittelmann","year":"2006","unstructured":"Mittelmann, H.D., & Pruessner, A. (2006). A server for automated performance analysis of benchmarking data. Optimization Methods and Software, 21, 105\u2013120.","journal-title":"Optimization Methods and Software"},{"key":"9267_CR137","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., & Cloud, M.J. (2009). Introduction to interval analysis. Siam Philadelphia.","DOI":"10.1137\/1.9780898717716"},{"key":"9267_CR138","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., & Sewell, E.C. (2016). Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19, 79\u2013102.","journal-title":"Discrete Optimization"},{"key":"9267_CR139","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th annual Design Automation Conference, pp. 530\u2013535.","DOI":"10.1145\/378239.379017"},{"key":"9267_CR140","unstructured":"Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., & W\u00e4chter, A. (2011). A probing algorithm for MINLP with failure prediction by SVM. In Achterberg, T., & Beck, J.C. (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 154\u2013169). Berlin: Springer."},{"key":"9267_CR141","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"GL Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., Savelsbergh, M.P., & Sigismondi, G.C. (1994). MINTO, a mixed INTeger optimizer. Operations Research Letters, 15, 47\u201358.","journal-title":"Operations Research Letters"},{"key":"9267_CR142","doi-asserted-by":"crossref","unstructured":"Neumaier, A. (1990). Interval methods for systems of equations Cambridge university press.","DOI":"10.1017\/CBO9780511526473"},{"key":"9267_CR143","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/S0036144594278060","volume":"39","author":"A Neumaier","year":"1997","unstructured":"Neumaier, A. (1997). Molecular modeling of proteins and mathematical prediction of protein structure. SIAM review, 39, 407\u2013460.","journal-title":"SIAM review"},{"key":"9267_CR144","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0962492904000194","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A. (2004). Complete search in continuous global optimization and constraint satisfaction. Acta numerica, 13, 271\u2013369.","journal-title":"Acta numerica"},{"key":"9267_CR145","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A., & Shcherbina, O. (2004). Safe bounds in linear and mixed-integer linear programming. Mathematical Programming, 99, 283\u2013296.","journal-title":"Mathematical Programming"},{"key":"9267_CR146","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., & Smriglio, S. (2011). Orbital branching. Mathematical Programming, 126, 147\u2013178.","journal-title":"Mathematical Programming"},{"key":"9267_CR147","doi-asserted-by":"crossref","unstructured":"O\u2019Sullivan, B. (2010). Automated Modelling and Solving in Constraint Programming. In Twenty-Fourth AAAI Conference on Artificial Intelligence.","DOI":"10.1609\/aaai.v24i1.7530"},{"key":"9267_CR148","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"PM Pardalos","year":"2004","unstructured":"Pardalos, P.M., Chaovalitwongse, W., Iasemidis, L.D., Sackellares, J.C., Shiau, D., Carney, P.R., Prokopyev, O.A., & Yatsenko, V.A. (2004). Seizure warning algorithm based on optimization and nonlinear dynamics. Mathematical Programming, 101, 365\u2013385.","journal-title":"Mathematical Programming"},{"key":"9267_CR149","unstructured":"Princeton Library. http:\/\/www.gamsworld.org\/performance\/princetonlib\/princetonlib.htm ."},{"key":"9267_CR150","doi-asserted-by":"crossref","unstructured":"Prosser, P., Stergiou, K., & Walsh, T. (2000). Singleton consistencies. In Dechter, R. (Ed.) Proceedings of 6th International Conference, CP 2000 Singapore (pp. 353\u2013368). Berlin: Springer.","DOI":"10.1007\/3-540-45349-0_26"},{"key":"9267_CR151","doi-asserted-by":"publisher","unstructured":"Puranik, Y., & Sahinidis, N.V. Bounds tightening on optimality conditions for nonconvex box-constrained optimization. Journal of Global Optimization. 10.1007\/s10898-016-0491-8","DOI":"10.1007\/s10898-016-0491-8"},{"key":"9267_CR152","unstructured":"Puranik, Y., & Sahinidis, N.V. Deletion presolve for accelerating infeasibility diagnosis in optimization models. INFORMS Journal on Computing (in review)."},{"key":"9267_CR153","doi-asserted-by":"crossref","unstructured":"Rajagopalan, S., & Sahinidis, N.V. (2017). The pooling problem. In Terlaky, T., Anjos, M., & Ahmed, S. (Eds.) Advances and Trends in Optimization with Engineering Applications, MOS-SIAM Book Series on Optimization. Philadelphia: SIAM.","DOI":"10.1137\/1.9781611974683.ch16"},{"key":"9267_CR154","unstructured":"R\u00e9gin, J.C. (2011). Milano Global constraints: A survey. In Van, P., & Hentenryck, M. (Eds.) Hybrid optimization: The Ten Years of CPAIOR (pp. 63\u2013134). New York: Springer."},{"key":"9267_CR155","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D. (1997). A convex envelope formula for multilinear functions. Journal of Global Optimization, 10, 425\u2013437.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR156","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.apenergy.2015.03.017","volume":"147","author":"RZ R\u00edos-Mercado","year":"2015","unstructured":"R\u00edos-Mercado, R.Z., & Borraz-S\u00e1nchez, C. (2015). Optimization problems in natural gas transportation systems: A state-of-the-art review. Applied Energy, 147, 536\u2013555.","journal-title":"Applied Energy"},{"key":"9267_CR157","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"TJV Roy","year":"1987","unstructured":"Roy, T.J.V., & Wolsey, L.A. (1987). Solving mixed integer programming problems using automatic reformulation. Operations Research, 35, 45\u201357.","journal-title":"Operations Research"},{"key":"9267_CR158","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., & Sahinidis, N.V. (1995). Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers & Chemical Engineering, 19, 551\u2013566.","journal-title":"Computers & Chemical Engineering"},{"key":"9267_CR159","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., & Sahinidis, N.V. (1996). A branch-and-reduce approach to global optimization. Journal of Global Optimization, 8, 107\u2013139.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR160","unstructured":"Sahinidis, N.V. (2003). Global optimization and constraint satisfaction: The branch-and-reduce approach. In Bliek, C., Jermann, C., & Neumaier, A. (Eds.) Global Optimization and Constraint Satisfaction, Lecture Notes in Computer Science, (Vol. 2861 pp. 1\u201316). Berlin: Springer."},{"key":"9267_CR161","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10898-004-2705-8","volume":"32","author":"NV Sahinidis","year":"2005","unstructured":"Sahinidis, N.V., & Tawarmalani, M. (2005). Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints. Journal of Global Optimization, 32, 259\u2013280.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR162","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF00143879","volume":"1","author":"D Sam-Haroud","year":"1996","unstructured":"Sam-Haroud, D., & Faltings, B. (1996). Consistency techniques for continuous constraints. Constraints, 1, 85\u2013118.","journal-title":"Constraints"},{"key":"9267_CR163","unstructured":"Sandholm, T., & Shields, R. (2006). Nogood learning for mixed integer programming. In Workshop on Hybrid Methods and Branching Rules in Combinatorial Optimization, Montr\u00e9al (p. 138)."},{"key":"9267_CR164","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P. (1994). Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing, 6, 445\u2013454.","journal-title":"ORSA Journal on Computing"},{"key":"9267_CR165","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10898-013-0137-z","volume":"59","author":"H Schichl","year":"2014","unstructured":"Schichl, H., Mark\u00f3t, M.C., & Neumaier, A. (2014). Exclusion regions for optimization problems. Journal of Global Optimization, 59, 569\u2013595.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR166","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/S0036142902418898","volume":"42","author":"H Schichl","year":"2004","unstructured":"Schichl, H., & Neumaier, A. (2004). Exclusion regions for systems of equations. SIAM Journal on numerical analysis, 42, 383\u2013408.","journal-title":"SIAM Journal on numerical analysis"},{"key":"9267_CR167","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10898-005-0937-x","volume":"33","author":"H Schichl","year":"2005","unstructured":"Schichl, H., & Neumaier, A. (2005). Interval analysis on directed acyclic graphs for global optimization. Journal of Global Optimization, 33, 541\u2013562.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR168","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/05063129X","volume":"17","author":"H Schichl","year":"2006","unstructured":"Schichl, H., & Neumaier, A. (2006). Transposition theorems and qualification-free optiMality conditions. SIAM Journal on Optimization, 17, 1035\u20131055.","journal-title":"SIAM Journal on Optimization"},{"key":"9267_CR169","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10898-009-9502-3","volume":"48","author":"A Sch\u00f6bel","year":"2010","unstructured":"Sch\u00f6bel, A., & Scholz, D. (2010). The theoretical and empirical rate of convergence for geometric branch-and-bound methods. Journal of Global Optimization, 48, 473\u2013495.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR170","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with kernels: Support vector machines, regularization, optimization, and beyond","author":"B Scholkopf","year":"2001","unstructured":"Scholkopf, B., & Smola, A.J. (2001). Learning with kernels: Support vector machines, regularization, optimization, and beyond. Cambridge: MIT press."},{"key":"9267_CR171","doi-asserted-by":"crossref","unstructured":"Sellmann, M. (2004). Theoretical foundations of CP-based Lagrangian relaxation. In Wallace, M. (Ed.) Proceedings of 10th International Conference, CP 2004, Toronto, Canada (pp. 634\u2013647). Berlin: Springer.","DOI":"10.1007\/978-3-540-30201-8_46"},{"key":"9267_CR172","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10898-011-9793-z","volume":"54","author":"EC Sewell","year":"2012","unstructured":"Sewell, E.C., Sauppe, J.J., Morrison, D.R., Jacobson, S.H., & Kao, G.K. (2012). A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. Journal of Global Optimization, 54, 791\u2013812.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR173","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008241411395","volume":"12","author":"JP Shectman","year":"1998","unstructured":"Shectman, J.P., & Sahinidis, N.V. (1998). A finite algorithm for global minimization of separable concave programs. Journal of Global Optimization, 12, 1\u201336.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR174","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., & Adams, W.P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics, 3, 411\u2013430.","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"1","key":"9267_CR175","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., & Adams, W.P. (1994). A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems. Discrete Applied Mathematics, 52(1), 83\u2013106.","journal-title":"Discrete Applied Mathematics"},{"key":"9267_CR176","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., & Adams, W.P. (1999). A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Nonconvex Optimization and its Applications Vol. 31. Dordrecht: Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"9267_CR177","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1021\/ie020224l","volume":"42","author":"M Sinha","year":"2003","unstructured":"Sinha, M., Achenie, L.E.K., & Gani, R. (2003). Blanket wash solvent blend design using interval analysis. Industrial & Engineering Chemistry Research, 42, 516\u2013527.","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"9267_CR178","unstructured":"Smith, A.B., & Sahinidis, N.V. (2009). Optimization techniques for phase retrieval based on single-crystal X-ray diffraction data. In Floudas, C.A., & Pardalos, P.M. (Eds.) Encyclopedia of Optimization (pp. 2858\u20132863). Boston: Springer."},{"key":"9267_CR179","doi-asserted-by":"crossref","unstructured":"Smith, E.M.B., & Pantelides, C.C. (1996). Global optimisation of general process models. In Grossmann, I.E. (Ed.) Global Optimization in Engineering Design (pp. 355\u2013386). Boston: Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-5331-8_12"},{"key":"9267_CR180","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","volume":"9","author":"RM Stallman","year":"1977","unstructured":"Stallman, R.M., & Sussman, G.J. (1977). Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial intelligence, 9, 135\u2013196.","journal-title":"Artificial intelligence"},{"key":"9267_CR181","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/AIC-2009-0450","volume":"22","author":"K Stergiou","year":"2009","unstructured":"Stergiou, K. (2009). Heuristics for dynamically adapting propagation in constraint satisfaction problems. AI Communications, 22, 125\u2013141.","journal-title":"AI Communications"},{"key":"9267_CR182","unstructured":"Sturtevant, N.R., Felner, A., Likhachev, M., & Ruml, W. (2012). Heuristic search comes of age. In AAAI12: Proceedings of the 26th AAAI Conference on Artifical Intelligence."},{"key":"9267_CR183","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-012-0581-4","volume":"138","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Richard, J.P., & Xiong, C. (2013). Explicit convex and concave envelopes through polyhedral subdivisions. Mathematical Programming, 138, 531\u2013577.","journal-title":"Mathematical Programming"},{"key":"9267_CR184","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., & Sahinidis, N.V. (2002). Convex extensions and convex envelopes of l.s.c. functions. Mathematical Programming, 93, 247\u2013263.","journal-title":"Mathematical Programming"},{"key":"9267_CR185","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., & Sahinidis, N.V. (2004). Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Mathematical Programming, 99, 563\u2013591.","journal-title":"Mathematical Programming"},{"key":"9267_CR186","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., & Sahinidis, N.V. (2005). A polyhedral branch-and-cut approach to global optimization. Mathematical Programming, 103, 225\u2013249.","journal-title":"Mathematical Programming"},{"key":"9267_CR187","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/moor.16.2.390","volume":"16","author":"LS Thakur","year":"1990","unstructured":"Thakur, L.S. (1990). Domain contraction in nonlinear programming: Minimizing a quadratic concave function over a polyhedron. Mathematics of Operations Research, 16, 390\u2013407.","journal-title":"Mathematics of Operations Research"},{"key":"9267_CR188","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1023\/A:1021136801775","volume":"115","author":"ES Thorsteinsson","year":"2002","unstructured":"Thorsteinsson, E.S., & Ottosson, G. (2002). Linear relaxations and reduced-cost based propagation of continuous variable subscripts. Annals of operations research, 115, 15\u201329.","journal-title":"Annals of operations research"},{"key":"9267_CR189","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF02591947","volume":"27","author":"JA Tomlin","year":"1983","unstructured":"Tomlin, J.A., & Welch, J.S. (1983). Formal optimization of some reduced linear programming problems. Mathematical programming, 27, 232\u2013240.","journal-title":"Mathematical programming"},{"key":"9267_CR190","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0167-6377(86)90093-3","volume":"5","author":"LA Tomlin","year":"1986","unstructured":"Tomlin, L.A., & Welch, J.S. (1986). Finding duplicate rows in a linear programming model. Operations Research Letters, 5, 7\u201311.","journal-title":"Operations Research Letters"},{"key":"9267_CR191","unstructured":"Torres, P., & Lopez, P. (2000). Overview and possible extensions of shaving techniques for job-shop problems. In 2nd International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 181\u2013186). Paderborn: Springer."},{"key":"9267_CR192","unstructured":"van Beek, P., & Beek, T. (2006). Walsh Backtracking search algorithms. In Rossi, F., & van, P. (Eds.) Handbook of Constraint Programming, chap. 4 (pp. 85\u2013134). Amsterdam: Elsevier."},{"key":"9267_CR193","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Michel, L., & Deville, Y. (1997). Numerica: A Modeling Language for Global Optimization. Cambridge, MA: The MIT Press.","DOI":"10.7551\/mitpress\/5073.001.0001"},{"key":"9267_CR194","unstructured":"van Iwaarden, R.J. (1996). An improved unconstrained global optimization algorithm. Ph.D. thesis: University of Colorado at Denver."},{"key":"9267_CR195","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., & Nemhauser, G.L. (2005). A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Mathematical Programming, 102, 559\u2013575.","journal-title":"Mathematical Programming"},{"key":"9267_CR196","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., & Nemhauser, G.L. (2005). A polyhedral study of nonconvex quadratic programs with box constraints. Mathematical Programming, 102, 531\u2013557.","journal-title":"Mathematical Programming"},{"key":"9267_CR197","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10472-009-9129-6","volume":"55","author":"X Vu","year":"2009","unstructured":"Vu, X., Sam-Haroud, D., & Faltings, B. (2009). Enhancing numerical constraint propagation using multiple inclusion representations. Annals of Mathematics and Artificial Intelligence, 55, 295\u2013354.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9267_CR198","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s10898-008-9386-7","volume":"45","author":"X Vu","year":"2009","unstructured":"Vu, X., Schichl, H., & Sam-Haroud, D. (2009). Interval propagation and search on directed acyclic graphs for numerical constraint solving. Journal of Global Optimization, 45, 499\u2013531.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR199","unstructured":"Waltz, D. (1975). Understanding line drawings of scenes with shadows. In Winston, P.H. (Ed.) The Pyschology of Computer Vision. New York: McGraw-Hill."},{"key":"9267_CR200","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10898-013-0059-9","volume":"58","author":"A Wechsung","year":"2014","unstructured":"Wechsung, A., Schaber, S.D., & Barton, P.I. (2014). The cluster problem revisited. Journal of Global Optimization, 58, 429\u2013438.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR201","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., & Grossmann, I.E. (1999). A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. Journal of Global Optimization, 14, 217\u2013249.","journal-title":"Journal of Global Optimization"},{"key":"9267_CR202","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1080\/10556788.2013.783032","volume":"29","author":"K Zorn","year":"2013","unstructured":"Zorn, K., & Sahinidis, N.V. (2013). Global optimization of general nonconvex problems with intermediate bilinear substructures. Optimization Methods and Software, 29, 442\u2013462.","journal-title":"Optimization Methods and Software"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9267-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9267-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9267-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T13:15:25Z","timestamp":1749906925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9267-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,14]]},"references-count":202,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9267"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9267-5","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,14]]}}}