{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:12Z","timestamp":1725558972638},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260035"},{"type":"electronic","value":"9783540320418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11425076_1","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T10:27:56Z","timestamp":1279016876000},"page":"1-14","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Pruning Technique Based on Linear Relaxations"],"prefix":"10.1007","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":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F.A. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Mathematics of Operations Research\u00a08(2), 273\u2013286 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"1_CR2","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.: Branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming\u00a087(1), 131\u2013152 (2000)","journal-title":"Mathematical Programming"},{"key":"1_CR3","unstructured":"Benhamou, F., McAllester, D., Van-Hentenryck, P.: CLP(intervals) revisited. In: Proceedings of the International Symposium on Logic Programming, pp. 124\u2013138 (1994)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01587085","volume":"44","author":"Y. Crama","year":"1989","unstructured":"Crama, Y.: Recognition problems for polynomial in 0-1 variables. Mathematical Programming\u00a044, 139\u2013155 (1989)","journal-title":"Mathematical Programming"},{"key":"1_CR5","unstructured":"Didrit, O.: Analyse par intervalles pour l\u2019automatique : r\u00e9solution globale et garantie de probl\u00e8mes non lin\u00e9aires en robotique et en commande robuste. PhD thesis, Universit\u00e9 Parix XI Orsay (1997)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Dietmaier, P.: The stewart-gough platform of general geometry can have 40 real postures. In: Advances in Robot Kinematics: Analysis and Control, pp. 1\u201310 (1998)","DOI":"10.1007\/978-94-015-9064-8_1"},{"volume-title":"Deterministic global optimization: theory, algorithms and applications","year":"2000","key":"1_CR7","unstructured":"Floudas, C.A. (ed.): Deterministic global optimization: theory, algorithms and applications. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"1_CR8","first-page":"230","volume-title":"Proceedings of ICLP 1999","author":"B. Frdric","year":"1999","unstructured":"Frdric, B., Frdric, G., Laurent, G., Jean-Franois, P.: Revising hull and box consistency. In: Proceedings of ICLP 1999, pp. 230\u2013244. The MIT Press, Cambridge (1999)"},{"key":"1_CR9","volume-title":"Global Optimization Using Interval Analysis","author":"E.R. Hansen","year":"1992","unstructured":"Hansen, E.R.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (1992)"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1009922003700","volume":"5","author":"H. Collavizza","year":"1999","unstructured":"Collavizza, H., Delobel, F., Rueher, M.: Comparing partial consistencies. Reliable Computing\u00a05(3), 213\u2013228 (1999)","journal-title":"Reliable Computing"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-46135-3_8","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"Y. Lebbah","year":"2002","unstructured":"Lebbah, Y., Rueher, M., Michel, C.: A global filtering algorithm for handling systems of quadratic equations and inequations. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 109\u2013123. Springer, Heidelberg (2002)"},{"key":"1_CR12","unstructured":"Lee, T.-Y., Shim, J.-K.: Elimination-based solution method for the forward kinematics of the general stewart-gough platform. In: Park, F.C., Iurascu, C.C. (eds.) Computational Kinematics, Mai. 20-22 pp. 259\u2013267 (2001)"},{"key":"1_CR13","unstructured":"Lhomme, O.: Consistency techniques for numeric csps. In: Proceedings of IJCAI 1993, pp. 232\u2013238 (1993)"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Journal of Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Journal of Artificial Intelligence"},{"key":"1_CR15","unstructured":"Michel, C., Lebbah, Y., Rueher, M.: Safe embedding of the simplex algorithm in a csp framework. In: Proc. of 5th Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, CPAIOR 2003, CRT, pp. 210\u2013220. Universit de Montral (2003)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A. Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer programming. Mathematical Programming, Ser. A\u00a099, 283\u2013296 (2004)","journal-title":"Mathematical Programming, Ser. A"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"A. Rikun","year":"1997","unstructured":"Rikun, A.: A convex envelope formula for multilinear functions. Journal of Global Optimization\u00a010, 425\u2013437 (1997)","journal-title":"Journal of Global Optimization"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02238642","volume":"48","author":"G. Rote","year":"1992","unstructured":"Rote, G.: The convergence rate of the sandwich algorithm for approximating convex functions. Comput.\u00a048, 337\u2013361 (1992)","journal-title":"Comput."},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"H.S. Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, V.: A branch-and-reduce approach to global optimization. Journal of Global Optimization\u00a08(2), 107\u2013139 (1996)","journal-title":"Journal of Global Optimization"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/A:1011295715398","volume":"19","author":"H.S. Ryoo","year":"2001","unstructured":"Ryoo, H.S., Sahinidis, V.: Analysis of bounds for multilinear functions. Journal of Global Optimization\u00a019, 403\u2013424 (2001)","journal-title":"Journal of Global Optimization"},{"key":"1_CR21","unstructured":"Sahinidis, V., Twarmalani, M.: Baron 5.0 : Global optimisation of mixed-integer nonlinear programs. Technical report, University of Illinois at Urbana-Champaign, Department of Chemical and Biomolecular Engeneering (2002)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"V. Sahinidis","year":"2004","unstructured":"Sahinidis, V., Twarmalani, M.: Global optimization of mixed-integer programs: A theoretical and computational study. Mathematical Programming, Ser. A\u00a099, 563\u2013591 (2004)","journal-title":"Mathematical Programming, Ser. A"},{"issue":"1","key":"1_CR23","first-page":"245","volume":"22","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta mathematica vietnamica\u00a022(1), 245\u2013270 (1997)","journal-title":"Acta mathematica vietnamica"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1008249414776","volume":"12","author":"H.D. Sherali","year":"1998","unstructured":"Sherali, H.D.: Global optimization of nonconvex polynomial programming problems having rational exponents. Journal of Global Optimization\u00a012, 267\u2013283 (1998)","journal-title":"Journal of Global Optimization"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial using a reformulation-linearization technique. Journal of Global Optimization\u00a07, 1\u201331 (1992)","journal-title":"Journal of Global Optimization"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1023\/A:1008237515535","volume":"10","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A comparison of two reformulation-linearization technique based on linear programming relaxations for polynomial porgramming problems. Journal of Global Optimization\u00a010, 381\u2013390 (1997)","journal-title":"Journal of Global Optimization"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D., Tuncbilek, C.H.: New reformulation linearization\/convexification relaxations for univariate and multivariate polynomial programming problems. Operations Research Letters\u00a021, 1\u20139 (1997)","journal-title":"Operations Research Letters"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D., Wang, H.: Global optimization of nonconvex factorable programming problems. Math. Program.\u00a089, 459\u2013478 (2001)","journal-title":"Math. Program."},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0036142995281504","volume":"34","author":"P. Van-Hentenryck","year":"1997","unstructured":"Van-Hentenryck, P., Mc Allester, D., Kapur, D.: Solving polynomial systems using branch and prune approach. SIAM Journal on Numerical Analysis\u00a034(2), 797\u2013827 (1997)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"1_CR30","unstructured":"Verschelde, J.: The database of polynomial systems. Technical report (2003), \n                    \n                      http:\/\/www.math.uic.edu\/jan\/Demo\/"},{"issue":"1","key":"1_CR31","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF02510924","volume":"38","author":"H. Kawata","year":"1998","unstructured":"Kawata, H., Yamamura, K., Tokue, A.: Interval solution of nonlinear equations using linear programming. BIT\u00a038(1), 186\u2013199 (1998)","journal-title":"BIT"}],"container-title":["Lecture Notes in Computer Science","Global Optimization and Constraint Satisfaction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11425076_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:06:25Z","timestamp":1619492785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11425076_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260035","9783540320418"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11425076_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}