{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:23:17Z","timestamp":1759530197279},"publisher-location":"London","reference-count":15,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781846286650"},{"type":"electronic","value":"9781846286667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-1-84628-666-7_1","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T11:00:08Z","timestamp":1270465208000},"page":"3-16","source":"Crossref","is-referenced-by-count":2,"title":["Managing Restaurant Tables using Constraints"],"prefix":"10.1007","author":[{"given":"Alfio","family":"Vidotto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Dechter, R. Constraint Processing, Morgan Kaufman, 2003.","key":"1_CR1"},{"unstructured":"Rossi, F., van Beek, P. and Walsh, T. (eds.), Handbook of Constraint Programming, Elsevier, (forthcoming) 2006","key":"1_CR2"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/B:ANOR.0000032572.32788.da","volume":"130","author":"C.P. Gomes","year":"2004","unstructured":"Gomes, C.P.; and Shmoys, D.B. \u201cApproximations and Randomization to Boost CSP Techniques\u201d, Annals of Operations Research, 130:117\u2013141, 2004","journal-title":"Annals of Operations Research"},{"issue":"12","key":"1_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P.; and Selman, B. \u201cAlgorithm portfolios\u201d, Artificial Intelligence 126(12): 43\u201362, 2001","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Vidotto, A.; Brown, K.N.; and Beck, J.C. \u201cRobust Constraint Solving Using Multiple Heuristics\u201d, Proceedings of the Sixteenth Irish Conference on Artificial Intelligence & Cognitive Science (AICS\u201905), 203\u2013212, 2005","key":"1_CR5","DOI":"10.1007\/11564751_109"},{"unstructured":"R\u00e9gin, J-C. \u201cA Filtering Algorithm for Constraints of Difference in CSPs\u201d, Proceedings AAAI-94, pp 362\u2013367, 1994.","key":"1_CR6"},{"unstructured":"Verfaillie, G.; and Schiex, T. \u201cSolution Reuse in Dynamic Constraint Satisfaction Problems\u201d, Proceedings AAAI-94, pp307\u2013312, 1994","key":"1_CR7"},{"issue":"1-4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1021853506616","volume":"118","author":"D.W. Fowler","year":"2003","unstructured":"Fowler, D.W.; and Brown, K.N. \u201cBranching constraint satisfaction problems and Markov Decision Problems compared\u201d, Annals of Operations Research, 118(1-4):85\u2013100, 2003","journal-title":"Annals of Operations Research"},{"unstructured":"Bent, R.; and Van Hentenryck, P. \u201cRegrets Only! Online Stochastic Optimization under Time Constraints\u201d, ProceedingsAAAI-04, 2004","key":"1_CR9"},{"unstructured":"Ran, Y.; Roos, N.; and van den Herik, J. \u201cApproaches to Find a Near-minimal Change Solution for Dynamic CSPs\u201d CPAIOR\u201902: Proceedings of the 4th International Workshop on Integration of AI and OR techniquesin Constraint Programming for Combinatorial Optimisation Problems, pp373\u2013387, 2002","key":"1_CR10"},{"unstructured":"Petcu, A.; and Faltings, B. \u201cOptimal solution stability in continuous-time optimization\u201d, DCR-05:Proceedings of the 6th International Workshop on Distributed Constraint Reasoning, pp207\u2013221, 2005","key":"1_CR11"},{"unstructured":"Davenport, AJ.; Gefllot, C.; and Beck, lC. \u201cSlack-based Techniques for Robust Schedules\u201d, Proceedings of the Sixth European Conference on Planning (ECP-200J), 2001","key":"1_CR12"},{"unstructured":"Hebrard, E.; Hnich, B.; and Walsh, T. \u201cRobust Solutions for Constraint Satisfaction and Optimization\u201d, Proceedings of the SixteenthEuropean Conference on Artificial Intelligence, ECAI-04, 2004","key":"1_CR13"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E.M. Arkin","year":"1987","unstructured":"Arkin, E.M.; and Silverberg, E.B. \u201cScheduling jobs with fixed start and end times\u201d, Discrete Applied Mathematics, 18:1\u20138, 1987","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"Korf, R. E. \u201cDepth-first iterative deepening: an optimal admissible tree search\u201d, Artificial Intelligence, 27:97\u2013109, 1985.","journal-title":"Artificial Intelligence"}],"container-title":["Applications and Innovations in Intelligent Systems XIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84628-666-7_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T21:51:26Z","timestamp":1619905886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84628-666-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9781846286650","9781846286667"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-84628-666-7_1","relation":{},"subject":[],"published":{"date-parts":[[2007]]}}}