Branching constraint satisfaction problems and Markov decision problems compared

DOI10.1023/A:1021853506616zbMath1026.90047OpenAlexW1530927535MaRDI QIDQ1861939

Kenneth N. Brown, David W. Fowler

Publication date: 10 March 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021853506616

zbMATH Keywords

uncertaintyconstraint satisfactionMarkov decision problems

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Markov and semi-Markov decision processes (90C40)

Related Items (2)

Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints ⋮ Constraint solving in uncertain and dynamic environments: A survey

This page was built for publication: Branching constraint satisfaction problems and Markov decision problems compared