The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures
Abstract
In this short paper we present a brief exposition of a composite decision process - our unifying formulation of search procedures - which provides new insights concerning the relationships among heuristic search, dynamic programming and branch and bound procedures.
Cite
Text
Kumar and Kanal. "The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures." AAAI Conference on Artificial Intelligence, 1983.Markdown
[Kumar and Kanal. "The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures." AAAI Conference on Artificial Intelligence, 1983.](https://mlanthology.org/aaai/1983/kumar1983aaai-composite/)BibTeX
@inproceedings{kumar1983aaai-composite,
title = {{The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures}},
author = {Kumar, Vipin and Kanal, Laveen N.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1983},
pages = {220-224},
url = {https://mlanthology.org/aaai/1983/kumar1983aaai-composite/}
}