{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:17:37Z","timestamp":1648678657649},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T00:00:00Z","timestamp":1257897600000},"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":[[2010,4]]},"DOI":"10.1007\/s10601-009-9084-1","type":"journal-article","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T07:08:57Z","timestamp":1257836937000},"page":"213-237","source":"Crossref","is-referenced-by-count":1,"title":["A branch and bound algorithm for numerical Max-CSP"],"prefix":"10.1007","volume":"15","author":[{"given":"Jean-Marie","family":"Normand","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Goldsztejn","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Christie","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Benhamou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,11]]},"reference":[{"key":"9084_CR1","first-page":"230","volume-title":"Proceedings of the 1999 international conference on logic programming, ICLP\u201999","author":"F Benhamou","year":"1999","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., & Puget, J.-F. (1999). Revising hull and box consistency. In Proceedings of the 1999 international conference on logic programming, ICLP\u201999 (pp. 230\u2013244). Cambridge, MA, USA: Massachusetts Institute of Technology."},{"issue":"4","key":"9084_CR2","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1145\/1024922.1024927","volume":"5","author":"F Benhamou","year":"2004","unstructured":"Benhamou, F., Goualard, F., Languenou, E., & Christie, M. (2004). Interval constraint solving for camera control and motion planning. ACM Transactions on Computational Logic, 5(4), 732\u2013767.","journal-title":"ACM Transactions on Computational Logic"},{"key":"9084_CR3","first-page":"124","volume-title":"International logic programming symposium, ILPS \u201994","author":"F Benhamou","year":"1994","unstructured":"Benhamou, F., McAllester, D., & van Hentenryck, P. (1994). CLP(intervals) revisited. In International logic programming symposium, ILPS \u201994 (pp. 124\u2013138). Cambridge: MIT."},{"issue":"1","key":"9084_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F Benhamou","year":"1997","unstructured":"Benhamou, F., & Older, W. J. (1997). Applying interval arithmetic to real, integer and Boolean constraints. Journal of Logic Programming, 32(1), 1\u201324.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"9084_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01807506","volume":"5","author":"A Borning","year":"1992","unstructured":"Borning, A., Freeman-Benson, B., & Wilson, M. (1992). Constraint hierarchies. Lisp and Symbolic Computation, 5(3), 223\u2013270.","journal-title":"Lisp and Symbolic Computation"},{"key":"9084_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-scale nonlinear optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R. H., Nocedal, J., & Waltz, R. A. (2006). KNITRO: An integrated package for nonlinear optimization. In Large-scale nonlinear optimization (pp. 35\u201359). New York: Springer."},{"key":"9084_CR7","unstructured":"Christie, M., & Normand, J.-M. (2005). A semantic space partitionning approach to virtual camera control. In Proceedings of the annual eurographics conference (Vol. 24, pp. 247\u2013256)."},{"key":"9084_CR8","unstructured":"Christie, M., Normand, J.-M., & Truchet, C. (2006). Computing inner approximations of numerical MaxCSP. In Interval analysis, constraint propagation, applications, IntCP 2006."},{"key":"9084_CR9","unstructured":"Collavizza, H., Delobel, F., & Rueher, M. (1999). Extending consistent domains of numeric CSP. In IJCAI \u201999: Proceedings of the sixteenth international joint conference on artificial intelligence (pp. 406\u2013413)."},{"key":"9084_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-540-45193-8_25","volume-title":"Principles and practice of constraint programming, CP 2003","author":"S Givry de","year":"2003","unstructured":"de Givry, S., Larrosa, J., Meseguer, P., & Schiex, T. (2003). Solving Max-SAT as weighted CSP. In Principles and practice of constraint programming, CP 2003 (pp. 363\u2013376). New York: Springer."},{"key":"9084_CR11","unstructured":"Delanoue, N., Jaulin, L., & Cottenceau, B. (2004). Counting the number of connected components of a set and its application to robotics. In PARA (pp. 93\u2013101)."},{"key":"9084_CR12","unstructured":"Dongarra, J. (2007). Performance of various computers using standard linear equations software. Technical report CS-89-85, University of Tennessee."},{"key":"9084_CR13","volume-title":"Facility location. Applications and theory","year":"2002","unstructured":"Drezner, Z., & Hamacher, H. W. (Eds.) (2002). Facility location. Applications and theory. New York: Springer."},{"issue":"1","key":"9084_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D. (1991). What every computer scientist should know about floating-point arithmetic. Computing Surveys, 23(1), 5\u201348.","journal-title":"Computing Surveys"},{"issue":"6","key":"9084_CR15","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1511\/2003.6.484","volume":"91","author":"B Hayes","year":"2003","unstructured":"Hayes, B. (2003). A lucid interval. American Scientist, 91(6), 484\u2013488.","journal-title":"American Scientist"},{"key":"9084_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s11590-006-0021-6","volume":"1","author":"MJ Hirsch","year":"2007","unstructured":"Hirsch, M. J., Meneses, C. N., Pardalos, P. M., & Resende, M. G. C. (2007). Global optimization by continuous grasp. Optimization Letters, 1, 201\u2013212.","journal-title":"Optimization Letters"},{"issue":"2","key":"9084_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0378-4754(93)90008-I","volume":"35","author":"L Jaulin","year":"1993","unstructured":"Jaulin, L., & Walter, E. (1993). Guaranteed nonlinear parameter estimation from bounded-error data via interval analysis. Mathematics and Computers in Simulation, 35(2), 123\u2013137.","journal-title":"Mathematics and Computers in Simulation"},{"issue":"11","key":"9084_CR18","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1109\/TAC.2002.804479","volume":"47","author":"L Jaulin","year":"2002","unstructured":"Jaulin, L., & Walter, E. (2002). Guaranteed robust nonlinear minimax estimation. IEEE Transaction on Automatic Control, 47(11), 1857\u20131864.","journal-title":"IEEE Transaction on Automatic Control"},{"key":"9084_CR19","unstructured":"Jaulin, L., Walter, E., & Didrit, O. (1996). Guaranteed robust nonlinear parameter bounding. In CESA\u201996, IMACS multiconference (symposium on modelling, analysis and simulation) (pp. 1156\u20131161)."},{"key":"9084_CR20","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric CSPs. In IJCAI \u201993: Proceedings of the thirteenth international joint conference on artificial intelligence (pp. 232\u2013238)."},{"issue":"1","key":"9084_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9084_CR22","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0005-1098(91)90090-O","volume":"27","author":"M Milanese","year":"1991","unstructured":"Milanese, M., & Vicino, A. (1991). Estimation theory for nonlinear models and set membership uncertainty. Automatica, 27(2), 403\u2013408.","journal-title":"Automatica"},{"issue":"1\u20133","key":"9084_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S Minton","year":"1992","unstructured":"Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1\u20133), 161\u2013205.","journal-title":"Artificial Intelligence"},{"key":"9084_CR24","volume-title":"Interval analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R. E. (1966). Interval analysis. Englewood Cliffs: Prentice-Hall."},{"key":"9084_CR25","unstructured":"Murtagh, B. A., & Saunders, M. A. (1998). Minos 5.5 user\u2019s guide. Technical report, Systems Optimization Laboratory, Department of Operations Research, Stanford University."},{"key":"9084_CR26","volume-title":"Interval methods for systems of equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A. (1990). Interval methods for systems of equations. Cambridge: Cambridge University Press."},{"key":"9084_CR27","unstructured":"Normand, J.-M. (2008). Placement de cam\u00e9ra en environnements virtuels. PhD thesis, Universit\u00e9 de Nantes."},{"key":"9084_CR28","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-46135-3_19","volume-title":"Principles and practice of constraint programming, CP 2002","author":"T Petit","year":"2002","unstructured":"Petit, T., R\u00e9gin, J.-C., & Bessi\u00e8re, C. (2002). Range-based algorithm for Max-CSP. In Principles and practice of constraint programming, CP 2002 (pp. 280\u2013294). New York: Springer."},{"key":"9084_CR29","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/3-540-61551-2_95","volume-title":"Principles and practice of constraint programming, CP 1996","author":"RJ Wallace","year":"1996","unstructured":"Wallace, R. J. (1996). Analysis of heuristic methods for partial constraint satisfaction problems. In Principles and practice of constraint programming, CP 1996 (pp. 482\u2013496). New York: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9084-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-009-9084-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9084-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:15Z","timestamp":1559243655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-009-9084-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,11]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9084"],"URL":"https:\/\/doi.org\/10.1007\/s10601-009-9084-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,11]]}}}