{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:11Z","timestamp":1759847951765},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10601-004-5307-7","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T08:46:16Z","timestamp":1108716376000},"page":"47-65","source":"Crossref","is-referenced-by-count":16,"title":["A Rigorous Global Filtering Algorithm for Quadratic Constraints*"],"prefix":"10.1007","volume":"10","author":[{"given":"Yahia","family":"Lebbah","sequence":"first","affiliation":[]},{"given":"Claude","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Rueher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0898-1221(90)90148-D","volume":"19","author":"F. Al-Khayyal","year":"1990","unstructured":"Al-Khayyal, F. (1990). Jointly constrained biconvex programming and related problems: An overview. Comput. Math. Appl. 19: 53?62.","journal-title":"Comput. Math. Appl."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F., & Falk, J. (1983). Jointly constrained biconvex programming. Math. Oper. Res. 8: 273?286.","journal-title":"Math. Oper. Res."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C. Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., & Savard, G. (2000). Branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Prog. 87(1): 131?152.","journal-title":"Math. Prog."},{"key":"CR4","unstructured":"Bazarra, M., Sherali, H., & Shetty, C. (1993). Nonlinear Programming: Theory and Algorithms. John Wiley & Sons."},{"issue":"3?4","key":"CR5","first-page":"317","volume":"6","author":"A. Bellido","year":"1992","unstructured":"Bellido, A. (1992). Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems. Numer. Algorithms 6(3?4): 317?351.","journal-title":"Numer. Algorithms"},{"key":"CR6","unstructured":"Benhamou, F., McAllester, D., & Van-Hentenryck P. (1994). CLP(intervals) revisited. In Proceedings of the International Symposium on Logic Programming, pages 124?138."},{"key":"CR7","unstructured":"COCONUT. (2002). A benchmark for global optimization and constraint satisfaction. Technical report, WWW-document (2002). http:\/\/www.mat.univie.ac.at\/neum\/glopt\/coconut\/benchmark.html."},{"key":"CR8","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"1997","unstructured":"Cox, D., Little, J., & O?Shea, D. (1997). Ideals, Varieties, and Algorithms. 2nd edition. New York: Springer-Verlag.","edition":"2"},{"key":"CR9","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. J. Artif. Intell. 32: 281?331.","journal-title":"J. Artif. Intell."},{"key":"CR10","unstructured":"Didrit, O. (1997). Analyse par intervalles pour l?automatique: R\u00e9solution globale et garantie de probl\u00e8mes non lin\u00e9aires en robotique et en commande robuste. Ph.D. thesis, Universit\u00e9 Parix XI Orsay."},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0004-3702(94)90022-1","volume":"60","author":"B. Faltings","year":"1994","unstructured":"Faltings, B. (1994). Arc consistency for continuous variables. J. Artif. Intell. 60(2): 363?376.","journal-title":"J. Artif. Intell."},{"key":"CR12","unstructured":"Granvilliers, L. (2004). RealPaver, Version 0.4, http:\/\/www.sciences.univernantes.fr\/info\/perso\/permanents\/granvil\/realpaver\/main.html."},{"key":"CR13","volume-title":"Global Optimization Using Interval Analysis","author":"E. R. Hansen","year":"1992","unstructured":"Hansen, E. R. (1992). Global Optimization Using Interval Analysis. New York: Marcel Dekker."},{"issue":"3","key":"CR14","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. Reliab. Comput. 5(3): 213?228.","journal-title":"Reliab. Comput."},{"key":"CR15","unstructured":"IEEE-754. (1985). IEEE Standard for Binary Floating Point Arithmetic. ANSI\/IEEE, New York, Std 754-1985 edition."},{"key":"CR16","unstructured":"Ilog (ed.) (2000a). ILOG CPLEX 7.0, Reference Manual. Ilog."},{"key":"CR17","unstructured":"Ilog (ed.) (2000b). ILOG Solver 5.0, Reference Manual. Ilog."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Jermann, C., Trombettoni, G., Neveu, B., & Rueher, M. (2000). A constraint programming approach for solving rigid geometric systems. In Proceedings of CP?00: Sixth International Conference on ?Principles and Practice of Constraint Programming?. Singapore, pages 233?248.","DOI":"10.1007\/3-540-45349-0_18"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Kearfott, R. B. (1996). Rigorous Global Search: Continous Problems. Kluwer Academic Publishers Group.","DOI":"10.1007\/978-1-4757-2495-0"},{"key":"CR20","unstructured":"Lebbah, Y. (1999). Contibution \u00e0 la r\u00e9solution de contraintes par consistance forte. Ph.D. thesis, Ecole des Mines de Nantes, France."},{"issue":"1","key":"CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0004-3702(02)00194-7","volume":"139","author":"Y. Lebbah","year":"2002","unstructured":"Lebbah, Y., & Lhomme, O. (2002). Accelerating filtering techniques for numeric CSPs?. Artif. Intill. 139(1): 109?132.","journal-title":"Artif. Intill."},{"key":"CR22","unstructured":"Lebba, Y., Michel, C., Rueher, M., Daney, D., & Merlet, J. (2205). Efficient and safe global constraints for handling numerical constraint system. SIAM journal of Numerical Analysis p. to appear."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-46135-3_8","volume":"2470","author":"Y. Lebbah","year":"2002","unstructured":"Lebbah, Y., Rueher, M., & Michel, C. (2002). A global filtering algorithm for handling systems of quadratic equations and inequations. Proc. CP?2002, Lect. Notes Comput. Sci. 2470: 109?123.","journal-title":"Proc. CP?2002, Lect. Notes Comput. Sci."},{"key":"CR24","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric CSPs?. In Proceedings of IJCAI?93, pages 232?238."},{"issue":"1?2","key":"CR25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0218213095000061","volume":"4","author":"P. Marti","year":"1995","unstructured":"Marti, P., & Rueher, M. (1995). A distributed cooperating constraints solving system. Int. J. Artif. Intell. Tools 4(1?2): 93?113.","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G. McCormick","year":"1976","unstructured":"McCormick, G. (1976). Computability of global solutions to factorable non-convex programs?Part I?Convex underestimating problems. Math. Prog. 10: 147?175.","journal-title":"Math. Prog."},{"key":"CR27","unstructured":"Michel, C., Lebbah, Y., & Rueher, M. (2003). Safe embedding of the Simplex Algorithm in a CSP framework. In Proceedings of 5th Internatinal Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems CPAIOR 2003, CRT, Universit\u00e9 de Montr\u00e9al, pages 210?220."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A. Neumaier","year":"2002","unstructured":"Neumaier, A., & Shcherbina, O. (2002). Safe bounds in linear and mixed-integer programming. Math. Prog A. 99: 283?296.","journal-title":"Math. Prog A."},{"issue":"1","key":"CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1008236911603","volume":"13","author":"J. Puget","year":"1998","unstructured":"Puget, J., & Van-Hentenryck, P. (1998). A constraints satisfaction approach to a circuit design problem. J. Glob. Optim. 13(1): 75?93.","journal-title":"J. Glob. Optim."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Sherali, H., & Adams, W. (1999). A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishing.","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H. Sherali","year":"1992","unstructured":"Sherali, H., & Tuncbilek, C. (1992). A global optimization algorithm for polynomial using a reformulation-linearization technique. J. Glob. Optim. 7: 1?31.","journal-title":"J. Glob. Optim."},{"key":"CR32","unstructured":"Van-Hentenryck, P., Michel, L., & Deville, Y. (1997). Numerica: a Modelling language for Global Optiization. MIT Press."},{"key":"CR33","unstructured":"Wunderlings, R. (1996). Paralleler und Objektorientierter Simplex-Algorithmus (in German). Ph.D. thesis, Berlin."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-004-5307-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-004-5307-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-004-5307-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:12Z","timestamp":1559229252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-004-5307-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["5307"],"URL":"https:\/\/doi.org\/10.1007\/s10601-004-5307-7","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}