{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:48:07Z","timestamp":1743094087328,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_14","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"205-219","source":"Crossref","is-referenced-by-count":0,"title":["A Branch and Bound Algorithm for Numerical MAX-CSP"],"prefix":"10.1007","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","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.: Range-based algorithm for max-csp. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 280\u2013294. Springer, Heidelberg (2002)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-540-45193-8_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"S. de Givry","year":"2003","unstructured":"de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving max-sat as weighted csp. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 363\u2013376. Springer, Heidelberg (2003)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations (1990)","DOI":"10.1017\/CBO9780511526473"},{"issue":"6","key":"14_CR4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1511\/2003.38.484","volume":"91","author":"B. Hayes","year":"2003","unstructured":"Hayes, B.: A Lucid Interval. American Scientist\u00a091(6), 484\u2013488 (2003)","journal-title":"American Scientist"},{"key":"14_CR5","volume-title":"Interval Analysis","author":"R.E. Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"key":"14_CR6","unstructured":"Lhomme, O.: Consistency techniques for numeric csps. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI), pp. 232\u2013238 (1993)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00142-2","volume":"32","author":"F. Benhamou","year":"1997","unstructured":"Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming\u00a032(1), 1\u201324 (1997)","journal-title":"Journal of Logic Programming"},{"key":"14_CR8","first-page":"124","volume-title":"ILPS 1994","author":"F. Benhamou","year":"1994","unstructured":"Benhamou, F., McAllester, D., van Hentenryck, P.: Clp(intervals) revisited. In: ILPS 1994, pp. 124\u2013138. MIT Press, Cambridge (1994)"},{"issue":"1","key":"14_CR9","first-page":"99","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. AI\u00a08(1), 99\u2013118 (1977)","journal-title":"AI"},{"key":"14_CR10","unstructured":"Collavizza, H., Delobel, F., Rueher, M.: Extending Consistent Domains of Numeric CSP. In: Proceedings of IJCAI 1999 (1999)"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1145\/1024922.1024927","volume":"5","author":"F. Benhamou","year":"2004","unstructured":"Benhamou, F., Goualard, F., Languenou, E., Christie, M.: Interval Constraint Solving for Camera Control and Motion Planning. ACM Trans. Comput. Logic\u00a05(4), 732\u2013767 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"14_CR12","unstructured":"Normand, J.M.: Placement de cam\u00e9ra en environnements virtuels. PhD thesis, Universit\u00e9 de Nantes (2008)"},{"issue":"1-3","key":"14_CR13","first-page":"161","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. AI\u00a058(1-3), 161\u2013205 (1992)","journal-title":"AI"},{"key":"14_CR14","first-page":"482","volume-title":"Lecture Notes in Computer Science","author":"Richard J. Wallace","year":"1996","unstructured":"Wallace, R.J.: Analysis of heuristic methods for partial constraint satisfaction problems. In: Principles and Practice of Constraint Programming, pp. 482\u2013496 (1996)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11590-006-0021-6","volume":"1","author":"M.J. Hirsch","year":"2007","unstructured":"Hirsch, M.J., Meneses, C.N., Pardalos, P.M., Resende, M.G.C.: Global optimization by continuous grasp. Optimization Letters\u00a01, 201\u2013212 (2007)","journal-title":"Optimization Letters"},{"issue":"8","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/0005-1098(96)00050-7","volume":"32","author":"L. Jaulin","year":"1996","unstructured":"Jaulin, L., Walter, E.: Guaranteed tuning, with application to robust control and motion planning. Automatica\u00a032(8), 1217\u20131221 (1996)","journal-title":"Automatica"},{"key":"14_CR17","unstructured":"Dongarra, J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, University of Tennessee (2007)"},{"key":"14_CR18","unstructured":"Christie, M., Normand, J.M., Truchet, C.: Computing inner approximations of numerical maxcsp. In: IntCP 2006 (2006)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/11558958_11","volume-title":"Applied Parallel Computing. State of the Art in Scientific Computing","author":"N. Delanoue","year":"2006","unstructured":"Delanoue, N., Jaulin, L., Cottenceau, B.: Counting the number of connected components of a set and its application to robotics. In: Dongarra, J., Madsen, K., Wa\u015bniewski, J. (eds.) PARA 2004. LNCS, vol.\u00a03732, pp. 93\u2013101. Springer, Heidelberg (2006)"},{"key":"14_CR20","series-title":"Applications and Theory","volume-title":"Facility Location","year":"2002","unstructured":"Drezner, Z., Hamacher, H. (eds.): Facility Location. Applications and Theory. Springer, New-York (2002)"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0378-4754(93)90008-I","volume":"35","author":"L. Jaulin","year":"1993","unstructured":"Jaulin, L., Walter, E.: Guaranteed nonlinear parameter estimation from bounded-error data via interval analysis. Math. Comput. Simul.\u00a035(2), 123\u2013137 (1993)","journal-title":"Math. Comput. Simul."},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0005-1098(91)90090-O","volume":"27","author":"M. Milanese","year":"1991","unstructured":"Milanese, M., Vicino, A.: Estimation theory for nonlinear models and set membership uncertainty. Automatica\u00a027(2), 403\u2013408 (1991)","journal-title":"Automatica"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01807506","volume":"5","author":"A. Borning","year":"1992","unstructured":"Borning, A., Freeman-Benson, B., Wilson, M.: Constraint hierarchies. Lisp Symb. Comput.\u00a05(3), 223\u2013270 (1992)","journal-title":"Lisp Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:04:15Z","timestamp":1715238255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}