{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:55:18Z","timestamp":1768272918813,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006579","name":"MIIT","doi-asserted-by":"crossref","award":["2017-ZJ-003"],"award-info":[{"award-number":["2017-ZJ-003"]}],"id":[{"id":"10.13039\/501100006579","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61621002"],"award-info":[{"award-number":["61621002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarships Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10898-020-00886-z","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T06:16:20Z","timestamp":1581401780000},"page":"425-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimality-based domain reduction for inequality-constrained NLP and MINLP problems"],"prefix":"10.1007","volume":"77","author":[{"given":"Yi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Nohra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Rong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,11]]},"reference":[{"key":"886_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Berlin (2013)"},{"key":"886_CR2","volume-title":"Control and Dynamic Systems, Advances in Theory and Applications","author":"V Balakrishnan","year":"1992","unstructured":"Balakrishnan, V., Boyd, S.: Global optimization in control system analysis and design. In: Leondes, C.T. (ed.) Control and Dynamic Systems, Advances in Theory and Applications. Academic Press, New York (1992)"},{"key":"886_CR3","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.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"886_CR4","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.: Progress in computational mixed integer programming-a look back from the other side of the tipping point. Ann. Oper. Res. 149, 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"key":"886_CR5","unstructured":"Bliek, C., Spellucci, P., Vicente, L.\u00a0N., Neumaier, A., Granvilliers, L., Huens, E., Hentenryck, P., Sam-Haroud, D., Faltings, B.: Algorithms for solving nonlinear constrained and optimization problems: the state of the art (2001). https:\/\/www.mat.univie.ac.at\/~neum\/ms\/StArt.pdf"},{"key":"886_CR6","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.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8, 54\u201383 (1975)","journal-title":"Math. Program."},{"key":"886_CR7","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.: MINLPLib-A collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"886_CR8","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.: Hydro energy systems management in Portugal: profit-based evaluation of a mixed-integer nonlinear approach. Energy 36, 500\u2013507 (2011)","journal-title":"Energy"},{"key":"886_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-018-1289-x","volume":"170","author":"A Cozad","year":"2018","unstructured":"Cozad, A., Sahinidis, N.V.: A global MINLP approach to symbolic regression. Math. Program. 170, 97\u2013119 (2018)","journal-title":"Math. Program."},{"key":"886_CR10","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.: A new approach for global optimization of a class of MINLP problems with applications to water management and pooling problems. AIChE J. 58, 2320\u20132335 (2012)","journal-title":"AIChE J."},{"key":"886_CR11","unstructured":"GLOBAL Library. http:\/\/www.gamsworld.org\/global\/globallib.htm"},{"key":"886_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","volume":"9","author":"J Gondzio","year":"1997","unstructured":"Gondzio, J.: Presolve analysis of linear programs prior to applying an interior point method. INFORMS J. Comput. 9, 73\u201391 (1997)","journal-title":"INFORMS J. Comput."},{"key":"886_CR13","first-page":"263","volume":"30","author":"IE Grossmann","year":"2000","unstructured":"Grossmann, I.E., Caballero, J.A., Yeomans, H.: Advances in mathematical programming for the synthesis of process systems. Lat. Am. Appl. Res. 30, 263\u2013284 (2000)","journal-title":"Lat. Am. Appl. Res."},{"key":"886_CR14","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.: Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105, 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"886_CR15","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.: Using dual presolving reductions to reformulate cumulative constraints. Constraints 18, 166\u2013201 (2013)","journal-title":"Constraints"},{"key":"886_CR16","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.: Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. 3, 121\u2013134 (1991)","journal-title":"ORSA J. Comput."},{"key":"886_CR17","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.: Global Optimization: Deterministic Approaches, Third edn. Springer, Berlin (1996)","edition":"Third"},{"key":"886_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02284625","volume":"17","author":"J Imbert","year":"1996","unstructured":"Imbert, J., Van Hentenryck, P.: Redundancy elimination with a lexicographic solved form. Ann. Math. Artif. Intell. 17, 85\u2013106 (1996)","journal-title":"Ann. Math. Artif. Intell."},{"key":"886_CR19","doi-asserted-by":"crossref","first-page":"4475","DOI":"10.1021\/ie901632w","volume":"49","author":"J Jezowski","year":"2010","unstructured":"Jezowski, J.: Review of water network design methods with literature annotations. Ind. Eng. Chem. Res. 49, 4475\u20134516 (2010)","journal-title":"Ind. Eng. Chem. Res."},{"key":"886_CR20","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.: Relaxations of factorable functions with convex-transformable intermediates. Math. Program. 144, 107\u2013140 (2014)","journal-title":"Math. Program."},{"key":"886_CR21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10, 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"key":"886_CR22","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24, 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"key":"886_CR23","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"AI Mahajan","year":"2010","unstructured":"Mahajan, A.I.: 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. Wiley, New York (2010)"},{"key":"886_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"886_CR25","volume-title":"Nonlinear Programming: Theory, Algorithms and Applications","author":"GP McCormick","year":"1983","unstructured":"McCormick, G.P.: Nonlinear Programming: Theory, Algorithms and Applications. Wiley, Hoboken (1983)"},{"key":"886_CR26","unstructured":"MINLP2 Library. http:\/\/www.minlplib.org"},{"key":"886_CR27","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, ChA: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59, 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"886_CR28","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/080717341","volume":"20","author":"A Mitsos","year":"2009","unstructured":"Mitsos, A., Chachuat, B., Barton, P.I.: Mccormick-based relaxations of algorithms. SIAM J. Optim. 20, 573\u2013601 (2009)","journal-title":"SIAM J. Optim."},{"key":"886_CR29","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.: MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15, 47\u201358 (1994)","journal-title":"Oper. Res. Lett."},{"key":"886_CR30","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1137\/S0036144594278060","volume":"39","author":"A Neumaier","year":"1997","unstructured":"Neumaier, A.: Molecular modeling of proteins and mathematical prediction of protein structure. SIAM Rev. 39, 407\u2013460 (1997)","journal-title":"SIAM Rev."},{"key":"886_CR31","unstructured":"Princeton Library. http:\/\/www.gamsworld.org\/performance\/princetonlib\/princetonlib.htm"},{"key":"886_CR32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10898-016-0491-8","volume":"67","author":"Y Puranik","year":"2017","unstructured":"Puranik, Y., Sahinidis, N.V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization. J. Glob. Optim. 67, 59\u201377 (2017)","journal-title":"J. Glob. Optim."},{"key":"886_CR33","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/s10601-016-9267-5","volume":"22","author":"Y Puranik","year":"2017","unstructured":"Puranik, Y., Sahinidis, N.V.: Domain reduction techniques for global NLP and MINLP optimization. Constraints 22, 338\u2013376 (2017)","journal-title":"Constraints"},{"key":"886_CR34","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.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19, 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"886_CR35","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.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8, 107\u2013139 (1996)","journal-title":"J. Glob. Optim."},{"key":"886_CR36","first-page":"1","volume-title":"Global Optimization and Constraint Satisfaction","author":"Nikolaos V. Sahinidis","year":"2003","unstructured":"Sahinidis, N.\u00a0V.: 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. Springer, Berlin (2003)"},{"key":"886_CR37","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s11081-019-09438-1","volume":"20","author":"NV Sahinidis","year":"2019","unstructured":"Sahinidis, N.V.: Mixed-integer nonlinear programming 2018. Optim. Eng. 20, 301\u2013306 (2019)","journal-title":"Optim. Eng."},{"key":"886_CR38","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.: Preprocessing and probing for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"886_CR39","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.: Interval analysis on directed acyclic graphs for global optimization. J. Glob. Optim. 33, 541\u2013562 (2005)","journal-title":"J. Glob. Optim."},{"key":"886_CR40","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.: A finite algorithm for global minimization of separable concave programs. J. Glob. Optim. 12, 1\u201336 (1998)","journal-title":"J. Glob. Optim."},{"key":"886_CR41","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Wang, H.: Global optimization of nonconvex factorable programming problems. Math. Program. 89, 459\u2013478 (2001)","journal-title":"Math. Program."},{"key":"886_CR42","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"886_CR43","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.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"886_CR44","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"TJ Van Roy","year":"1987","unstructured":"Van Roy, T.J., Wolsey, L.A.: Solving mixed integer programming problems using automatic reformulation. Oper. Res. 35, 45\u201357 (1987)","journal-title":"Oper. Res."},{"issue":"3","key":"886_CR45","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2018)","journal-title":"Optim. Methods Softw."},{"key":"886_CR46","unstructured":"Vigerske, S.: Decomposition of multistage stochastic programs and a constraint integer programming approach to mixed-integer nonlinear programming. PhD thesis, Humboldt Universit\u00e4t zu Berlin (2013)"},{"key":"886_CR47","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.compchemeng.2017.02.010","volume":"106","author":"ZT Wilson","year":"2017","unstructured":"Wilson, Z.T., Sahinidis, N.V.: The ALAMO approach to machine learning. Comput. Chem. Eng. 106, 785\u2013795 (2017)","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00886-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00886-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00886-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T07:15:03Z","timestamp":1612941303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00886-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,11]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["886"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00886-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,11]]},"assertion":[{"value":"29 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}