{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:12Z","timestamp":1761620832661,"version":"3.40.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1023\/a:1021853506616","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:02Z","timestamp":1048290962000},"page":"85-100","source":"Crossref","is-referenced-by-count":11,"title":["Branching Constraint Satisfaction Problems and Markov Decision Problems Compared"],"prefix":"10.1007","volume":"118","author":[{"given":"David W.","family":"Fowler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5110900_CR1","volume-title":"Dynamic Programming","author":"R.E. Bellman","year":"1957","unstructured":"R.E. Bellman, Dynamic Programming (Princeton University Press, Princeton, NJ, 1957)."},{"key":"5110900_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.575","volume":"1","author":"C. Boutilier","year":"1999","unstructured":"C. Boutilier, T. Dean and S. Hanks, Decision-theoretic planning: structural assumptions and computation leverage, Journal of Artificial Intelligence Research 1 (1999) 1\u201393.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5110900_CR3","unstructured":"C. Boutillier, R. Dearden and M. Goldszmidt, Exploiting structure in policy construction, in: Proceedings of IJCAI-95 (1995)."},{"key":"5110900_CR4","unstructured":"J.A. Boyan and A.W. Moore, Learning evaluation functions for large acyclic domains, in: Machine Learning: Proceedings of the Thirteenth International Conference, ed. L. Saitta (1996) pp. 63\u201370."},{"key":"5110900_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990)."},{"key":"5110900_CR6","unstructured":"R. Dechter and A. Dechter, Belief maintenance in dynamic constraint networks. in: Proceedings of AAAI-88 (1988) pp. 37\u201343."},{"key":"5110900_CR7","unstructured":"H. Fargier, J. Lang and T. Schiex, Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge, in: Proceedings of AAAI-96, Portland, OR (1996)."},{"key":"5110900_CR8","doi-asserted-by":"crossref","unstructured":"D.W. Fowler and K.N. Brown, Branching constraint satisfaction problems for solutions robust under likely changes, in: Proceedings of CP2000, Singapore (2000) pp. 500\u2013504.","DOI":"10.1007\/3-540-45349-0_38"},{"key":"5110900_CR9","unstructured":"D.W. Fowler and K.N. Brown, Modelling and solving problems with probable changes, in: ECAI 2000 Workshop on Modelling and Solving Problems with Constraints, Berlin (2000) pp. E:1\u20139."},{"key":"5110900_CR10","unstructured":"M.L. Ginsberg, A.J. Parkes and A. Roy, Supermodels and robustness, in: AAAI-98 (1998) pp. 334\u2013339."},{"key":"5110900_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"M. Haralick","year":"1980","unstructured":"M. Haralick and G.L. Elliott, Increasing tree-search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 263\u2013313.","journal-title":"Artificial Intelligence"},{"key":"5110900_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P.V. Hentenryck","year":"1992","unstructured":"P.V. Hentenryck, Y. Deville and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence 57 (1992) 291\u2013321.","journal-title":"Artificial Intelligence"},{"key":"5110900_CR13","unstructured":"R.A. Howard, Dynamic Programming and Markov Processes (MIT Press\/ Wiley, 1960)."},{"key":"5110900_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","volume":"89","author":"G. Kondrak","year":"1997","unstructured":"G. Kondrak and P. van Beek, A theoretical evaluation of selected backtracking algorithms, Artificial Intelligence 89 (1997) 365\u2013387.","journal-title":"Artificial Intelligence"},{"key":"5110900_CR15","unstructured":"M.L. Littman, Initial experiments in stochastic satisfiability, in: Proceedings of AAAI-99 (1999) pp. 667\u2013672."},{"key":"5110900_CR16","unstructured":"M.L. Littman, T.L. Dean and L.P. Kaelbling, On the complexity of solvingMarkov decision problems, in: 11th Annual Conference on Uncertainty in Artificial Intelligence (UAI-1995) (1995)."},{"issue":"3","key":"5110900_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Computational Intelligence 9(3) (1993) 268\u2013299.","journal-title":"Computational Intelligence"},{"key":"5110900_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"M.L. Puterman","year":"1994","unstructured":"M.L. Puterman, Markov Decision Processes (Wiley, New York, 1994)."},{"key":"5110900_CR19","unstructured":"G. Verfaillie and T. Schiex, Solution reuse in dynamic constraint satisfaction problems, in: Proceedings of AAAI-94, Seattle, WA, USA (1994) pp. 307\u2013312."},{"key":"5110900_CR20","doi-asserted-by":"crossref","unstructured":"R.J. Wallace and E.C. Freuder, Stable solutions for dynamic constraint satisfaction problems, in: Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, Salzburg, Austria (1997).","DOI":"10.1007\/3-540-49481-2_32"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021853506616.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021853506616\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021853506616.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:05:12Z","timestamp":1747577112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021853506616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":20,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["5110900"],"URL":"https:\/\/doi.org\/10.1023\/a:1021853506616","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}