{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:22:24Z","timestamp":1725895344213},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_23","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"290-298","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive Bisection of Numerical CSPs"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Granvilliers","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(Intervals) Revisited. In: Proc. ILPS, pp. 124\u2013138 (1994)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T. Csendes","year":"1997","unstructured":"Csendes, T., Ratz, D.: Subdivision Direction Selection in Interval Methods for Global Optimization. SIAM J. Numerical Analysis\u00a034, 922\u2013938 (1997)","journal-title":"SIAM J. Numerical Analysis"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/1132973.1132980","volume":"32","author":"L. Granvilliers","year":"2006","unstructured":"Granvilliers, L., Benhamou, F.: Algorithm 852: Realpaver: an Interval Solver using Constraint Satisfaction Techniques. ACM Trans. Mathematical Software\u00a032(1), 138\u2013156 (2006)","journal-title":"ACM Trans. Mathematical Software"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F. (eds.): Autonomous Search. Springer (2012)","DOI":"10.1007\/978-3-642-21434-9"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0036142995281504","volume":"34","author":"P. Hentenryck Van","year":"1997","unstructured":"Van Hentenryck, P., Mcallester, D., Kapur, D.: Solving Polynomial Systems Using a Branch and Prune Approach. SIAM J. Numerical Analysis\u00a034, 797\u2013827 (1997)","journal-title":"SIAM J. Numerical Analysis"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/29380.29862","volume":"13","author":"R.B. Kearfott","year":"1987","unstructured":"Kearfott, R.B.: Some Tests of Generalized Bisection. ACM Trans. Mathematical Software\u00a013(3), 197\u2013220 (1987)","journal-title":"ACM Trans. Mathematical Software"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/78928.78931","volume":"16","author":"R.B. Kearfott","year":"1990","unstructured":"Kearfott, R.B., Novoa, M.: Algorithm 681: INTBIS, a portable interval Newton\/bisection package. ACM Trans. Mathematical Software\u00a016(2), 152\u2013157 (1990)","journal-title":"ACM Trans. Mathematical Software"},{"key":"23_CR9","unstructured":"Lhomme, O.: Consistency Techniques for Numeric CSPs. In: Proc. IJCAI, pp. 232\u2013238 (1993)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Refalo","year":"2004","unstructured":"Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner Regions and Interval Linearizations for Global Optimization. In: Proc. AAAI, pp. 99\u2013104 (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"key":"23_CR12","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)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T01:43:07Z","timestamp":1687743787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}