{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:15:31Z","timestamp":1763201731405},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_1","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"1-16","source":"Crossref","is-referenced-by-count":34,"title":["A Contractor Based on Convex Interval Taylor"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Araya","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Trombettoni","sequence":"additional","affiliation":[]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0024-3795(96)00291-1","volume":"259","author":"O. Aberth","year":"1997","unstructured":"Aberth, O.: The Solution of Linear Interval Equations by a Linear Programming Method. Linear Algebra and its Applications\u00a0259, 271\u2013279 (1997)","journal-title":"Linear Algebra and its Applications"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: Exploiting Monotonicity in Interval Constraint Propagation. In: Proc. AAAI, pp. 9\u201314 (2010)","DOI":"10.1609\/aaai.v24i1.7541"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A Contractor Based on Convex Interval Taylor. Technical Report 7887, INRIA (February 2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"issue":"7","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1002\/aic.11777","volume":"55","author":"A. Baharev","year":"2009","unstructured":"Baharev, A., Achterberg, T., R\u00e9v, E.: Computation of an Extractive Distillition Column with Affine Arithmetic. AIChE Journal\u00a055(7), 1695\u20131704 (2009)","journal-title":"AIChE Journal"},{"key":"1_CR5","unstructured":"Beaumont, O.: Algorithmique pour les intervalles. PhD thesis, Universit\u00e9 de Rennes (1997)"},{"key":"1_CR6","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising Hull and Box Consistency. In: Proc. ICLP, pp. 230\u2013244 (1999)"},{"key":"1_CR7","unstructured":"Bliek, C.: Computer Methods for Design Automation. PhD thesis, MIT (1992)"},{"key":"1_CR8","unstructured":"Chabert, G.: Techniques d\u2019intervalles pour la r\u00e9solution de syst\u00e8mes d\u2019intervalles. PhD thesis, Universit\u00e9 de Nice\u2013Sophia (2007)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G. Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L.: Contractor Programming. Artificial Intelligence\u00a0173, 1079\u20131100 (2009)","journal-title":"Artificial Intelligence"},{"issue":"1-4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/B:NUMA.0000049462.70970.b6","volume":"37","author":"L. Figueiredo de","year":"2004","unstructured":"de Figueiredo, L., Stolfi, J.: Affine Arithmetic: Concepts and Applications. Numerical Algorithms\u00a037(1-4), 147\u2013158 (2004)","journal-title":"Numerical Algorithms"},{"issue":"2","key":"1_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s10601-009-9082-3","volume":"15","author":"A. Goldsztejn","year":"2010","unstructured":"Goldsztejn, A., Granvilliers, L.: A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. Constraints (Springer)\u00a015(2), 190\u2013212 (2010)","journal-title":"Constraints (Springer)"},{"key":"1_CR12","unstructured":"Hansen, E.: Global Optimization using Interval Analysis. Marcel Dekker Inc. (1992)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1090\/S0025-5718-1968-0229411-4","volume":"22","author":"E.R. Hansen","year":"1968","unstructured":"Hansen, E.R.: On Solving Systems of Equations Using Interval Arithmetic. Mathematical Comput.\u00a022, 374\u2013384 (1968)","journal-title":"Mathematical Comput."},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/0729086","volume":"29","author":"E.R. Hansen","year":"1992","unstructured":"Hansen, E.R.: Bounding the Solution of Interval Linear Equations. SIAM J. Numerical Analysis\u00a029(5), 1493\u20131503 (1992)","journal-title":"SIAM J. Numerical Analysis"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers (1996)","DOI":"10.1007\/978-1-4757-2495-0"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kreinovich, V., Lakeyev, A.V., Rohn, J., Kahl, P.T.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer (1997)","DOI":"10.1007\/978-1-4757-2793-7"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.cam.2005.08.037","volume":"199","author":"Y. Lebbah","year":"2007","unstructured":"Lebbah, Y., Michel, C., Rueher, M.: An Efficient and Safe Framework for Solving Optimization Problems. J. Computing and Applied Mathematics\u00a0199, 372\u2013377 (2007)","journal-title":"J. Computing and Applied Mathematics"},{"issue":"5","key":"1_CR18","doi-asserted-by":"publisher","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.: Efficient and safe global constraints for handling numerical constraint systems. SIAM Journal on Numerical Analysis\u00a042(5), 2076\u20132097 (2005)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"3741","DOI":"10.1021\/ie034073d","volume":"43","author":"Y. Lin","year":"2004","unstructured":"Lin, Y., Stadtherr, M.: LP Strategy for the Interval-Newton Method in Deterministic Global Optimization. Industrial & Engineering Chemistry Research\u00a043, 3741\u20133749 (2004)","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"McAllester, D., Van Hentenryck, P., Kapur, D.: Three Cuts for Accelerated Interval Propagation. Technical Report AI Memo 1542, Massachusetts Institute of Technology (1995)","DOI":"10.21236\/ADA298215"},{"issue":"6","key":"1_CR21","first-page":"589","volume":"4","author":"F. Messine","year":"1998","unstructured":"Messine, F., Laganouelle, J.-L.: Enclosure Methods for Multivariate Differentiable Functions and Application to Global Optimization. Journal of Universal Computer Science\u00a04(6), 589\u2013603 (1998)","journal-title":"Journal of Universal Computer Science"},{"key":"1_CR22","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall (1966)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM (2009)","DOI":"10.1137\/1.9780898717716"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge Univ. Press (1990)","DOI":"10.1017\/CBO9780511526473"},{"key":"1_CR25","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\u00a099, 283\u2013296 (2004)","journal-title":"Mathematical Programming"},{"key":"1_CR26","unstructured":"Ninin, J., Messine, F., Hansen, P.: A Reliable Affine Relaxation Method for Global Optimization. research report RT-APO-10-05, IRIT (March 2010) (submitted)"},{"issue":"1","key":"1_CR27","first-page":"115","volume":"2","author":"W. Oettli","year":"1965","unstructured":"Oettli, W.: On the Solution Set of a Linear System with Inaccurate Coefficients. SIAM J. Numerical Analysis\u00a02(1), 115\u2013118 (1965)","journal-title":"SIAM J. Numerical Analysis"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The Complexity of Satis ability Problems. In: Proc. STOC, ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0103(2), 225\u2013249 (2005)","journal-title":"Mathematical Programming"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner Regions and Interval Linearizations for Global Optimization. In: AAAI, pp. 99\u2013104 (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-74970-7_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"G. Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive Interval Disjunction. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 635\u2013650. Springer, Heidelberg (2007)"},{"issue":"3-4","key":"1_CR32","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10472-009-9129-6","volume":"55","author":"X.-H. Vu","year":"2009","unstructured":"Vu, X.-H., Sam-Haroud, D., Faltings, B.: Enhancing Numerical Constraint Propagation using Multiple Inclusion Representations. Annals of Mathematics and Artificial Intelligence\u00a055(3-4), 295\u2013354 (2009)","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T18:34:03Z","timestamp":1687458843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}