{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:37:28Z","timestamp":1765960648429},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_7","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T11:12:57Z","timestamp":1292411577000},"page":"65-76","source":"Crossref","is-referenced-by-count":20,"title":["Feasibility-Based Bounds Tightening via Fixed Points"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Belotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Cafieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-13193-6_30","volume-title":"Experimental Algorithms","author":"C. D\u2019Ambrosio","year":"2010","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experiments with a feasibility pump approach for nonconvex MINLPs. In: Festa, P. (ed.) Experimental Algorithms. LNCS, vol.\u00a06049, pp. 350\u2013360. Springer, Heidelberg (2010)"},{"key":"7_CR2","series-title":"Annals of Information Systems","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-1-4419-1306-7_9","volume-title":"Hybridizing Metaheuristics and Mathematical Programming","author":"L. Liberti","year":"2009","unstructured":"Liberti, L., Mladenovi\u0107, N., Nannicini, G.: A good recipe for solving MINLPs. In: Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.) Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol.\u00a010, pp. 231\u2013244. Springer, New York (2009)"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/S105262349935178X","volume":"10","author":"F. Al-Khayyal","year":"2000","unstructured":"Al-Khayyal, F., Sherali, H.: On finitely terminating branch-and-bound algorithms for some global optimization problems. SIAM Journal of Optimization\u00a010(4), 1049\u20131057 (2000)","journal-title":"SIAM Journal of Optimization"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"2430","DOI":"10.1016\/j.enpol.2008.01.009","volume":"36","author":"M. Bruglieri","year":"2008","unstructured":"Bruglieri, M., Liberti, L.: Optimal running and planning of a biomass-based energy production process. Energy Policy\u00a036, 2430\u20132438 (2008)","journal-title":"Energy Policy"},{"key":"7_CR5","volume-title":"Integrated methods for optimization","author":"J. Hooker","year":"2007","unstructured":"Hooker, J.: Integrated methods for optimization. Springer, New York (2007)"},{"key":"7_CR6","first-page":"19","volume-title":"The Psychology of Computer Vision","author":"D. Waltz","year":"1975","unstructured":"Waltz, D.: Understanding the line drawings of scenes with shadows. In: Winston, P. (ed.) The Psychology of Computer Vision, pp. 19\u201391. McGraw-Hill, New York (1975)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E. Davis","year":"1987","unstructured":"Davis, E.: Constraint propagation with interval labels. Artificial Intelligence\u00a032, 281\u2013331 (1987)","journal-title":"Artificial Intelligence"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0004-3702(94)90022-1","volume":"65","author":"B. Faltings","year":"1994","unstructured":"Faltings, B.: Arc-consistency for continuous variables. Artificial Intelligence\u00a065, 363\u2013376 (1994)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.: Preprocessing and probing techniques for mixed integer programming problems. INFORMS Journal on Computing\u00a06(4), 445\u2013454 (1994)","journal-title":"INFORMS Journal on Computing"},{"key":"7_CR10","first-page":"221","volume":"71","author":"D. Andersen","year":"1995","unstructured":"Andersen, D., Andersen, K.: Presolving in linear programming. Mathematical Programming\u00a071, 221\u2013245 (1995)","journal-title":"Mathematical Programming"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008241411395","volume":"12","author":"J. Shectman","year":"1998","unstructured":"Shectman, J., Sahinidis, N.: A finite algorithm for global minimization of separable concave programs. Journal of Global Optimization\u00a012, 1\u201336 (1998)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","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. Journal of Global Optimization\u00a033(4), 541\u2013562 (2005)","journal-title":"Journal of Global Optimization"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10898-008-9386-7","volume":"45","author":"X.H. Vu","year":"2009","unstructured":"Vu, X.H., Schichl, H., Sam-Haroud, D.: Interval propagation and search on directed acyclic graphs for numerical constraint solving. Journal of Global Optimization\u00a045, 499\u2013531 (2009)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1051\/ro\/2009005","volume":"43","author":"L. Liberti","year":"2009","unstructured":"Liberti, L.: Reformulations in mathematical programming: Definitions and systematics. RAIRO-RO\u00a043(1), 55\u201386 (2009)","journal-title":"RAIRO-RO"},{"key":"7_CR15","volume-title":"The Art of Computer Programming, Part II: Seminumerical Algorithms","author":"D. Knuth","year":"1981","unstructured":"Knuth, D.: The Art of Computer Programming, Part II: Seminumerical Algorithms. Addison-Wesley, Reading (1981)"},{"key":"7_CR16","volume-title":"Simulation and Optimization of Large Systems","author":"I. Bogle","year":"1988","unstructured":"Bogle, I., Pantelides, C.: Sparse nonlinear systems in chemical process simulation. In: Osiadacz, A. (ed.) Simulation and Optimization of Large Systems. Clarendon Press, Oxford (1988)"},{"key":"7_CR17","unstructured":"Keeping, B., Pantelides, C.: Novel methods for the efficient evaluation of stored mathematical expressions on scalar and vector computers. AIChE Annual Meeting, Paper #204b (November 1997)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E. Smith","year":"1999","unstructured":"Smith, E., Pantelides, C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering\u00a023, 457\u2013478 (1999)","journal-title":"Computers & Chemical Engineering"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/0-387-30528-9_8","volume-title":"Global Optimization: from Theory to Implementation","author":"L. Liberti","year":"2006","unstructured":"Liberti, L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 211\u2013262. Springer, Berlin (2006)"},{"issue":"4","key":"7_CR20","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 and Software\u00a024(4), 597\u2013634 (2009)","journal-title":"Optimization Methods and Software"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10898-009-9484-1","volume":"47","author":"S. Cafieri","year":"2010","unstructured":"Cafieri, S., Lee, J., Liberti, L.: On convex relaxations of quadrilinear terms. Journal of Global Optimization\u00a047, 661\u2013685 (2010)","journal-title":"Journal of Global Optimization"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Costa, A., Hansen, P., Liberti, L.: Formulation symmetries in circle packing. In: Mahjoub, R. (ed.) Proceedings of the International Symposium on Combinatorial Optimization. Electronic Notes in Discrete Mathematics. Elsevier, Amsterdam (accepted)","DOI":"10.1016\/j.endm.2010.05.165"},{"key":"7_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"R. Moore","year":"2009","unstructured":"Moore, R., Kearfott, R., Cloud, M.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)"},{"key":"7_CR24","volume-title":"Lattices and Ordered Sets","author":"S. Roman","year":"2008","unstructured":"Roman, S.: Lattices and Ordered Sets. Springer, New York (2008)"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580665","volume":"10","author":"G. McCormick","year":"1976","unstructured":"McCormick, G.: Computability of global solutions to factorable nonconvex programs: Part I \u2014 Convex underestimating problems. Mathematical Programming\u00a010, 146\u2013175 (1976)","journal-title":"Mathematical Programming"},{"issue":"9","key":"7_CR26","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"C. Adjiman","year":"1998","unstructured":"Adjiman, C., Dallwig, S., Floudas, C., Neumaier, A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs: I. Theoretical advances. Computers & Chemical Engineering\u00a022(9), 1137\u20131158 (1998)","journal-title":"Theoretical advances. Computers & Chemical Engineering"},{"key":"7_CR27","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.: Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming\u00a099, 563\u2013591 (2004)","journal-title":"Mathematical Programming"},{"issue":"2","key":"7_CR28","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1007\/978-3-540-74970-7_56","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Bordeaux","year":"2007","unstructured":"Bordeaux, L., Hamadi, Y., Vardi, M.: An analysis of slow convergence in interval propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 790\u2013797. Springer, Heidelberg (2007)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Bussieck, M., Drud, A., Meeraus, A.: MINLPLib \u2014 A collection of test models for mixed-integer nonlinear programming. INFORMS Journal on Computing\u00a015(1) (2003)","DOI":"10.1287\/ijoc.15.1.114.15159"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Liberti, L., Cafieri, S., Savourey, D.: Reformulation-Optimization Software Engine. In: Fukuda, K. (ed.) Mathematical Software. LNCS, vol.\u00a06327, pp. 303\u2013314. Springer, New York (2010)","DOI":"10.1007\/978-3-642-15582-6_50"},{"key":"7_CR32","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-642-01085-9_7","volume-title":"Foundations of Computational Intelligence","author":"L. Liberti","year":"2009","unstructured":"Liberti, L., Cafieri, S., Tarissan, F.: Reformulations in mathematical programming: A computational approach. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence. Studies in Computational Intelligence, vol.\u00a03(203), pp. 153\u2013234. Springer, Berlin (2009)"},{"key":"7_CR33","unstructured":"ILOG: ILOG CPLEX 11.0 User\u2019s Manual. ILOG S.A., Gentilly, France (2008)"},{"key":"7_CR34","volume-title":"The AMPL Book","author":"R. Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:29:39Z","timestamp":1553282979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}