Branching constraint satisfaction problems and Markov decision problems compared

DOI10.1023/A:1021853506616MaRDI QIDQ1861939zbMATH OpenOpenAlexFDO

Authors David W. Fowler, Kenneth N. Brown

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

constraint satisfactionMarkov decision problemsuncertainty

Mathematics Subject Classification ID

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

Recommendations

• Decision network semantics of branching constraint satisfaction problems
• scientific article; zbMATH DE number 2080330
• A refined branching algorithm for the maximum satisfiability problem
• Branching Programs and Binary Decision Diagrams
• Markov decision programming with constraints
• Counting-based search: branching heuristics for constraint satisfaction problems
• Solving Markov decision processes by \(d\)-graph algorithms
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations

Cited in

(4)

• Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
• scientific article; zbMATH DE number 2080330 (Why is no real title available?)
• Decision network semantics of branching constraint satisfaction problems
• Constraint solving in uncertain and dynamic environments: A survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861939)