Dijkstra's algorithm revisited: the dynamic programming connexion
A classical decision theoretic perspective on worst-case analysis
We examine worst-case analysis from the standpoint of classical Decision Theory. We elucidate how this analysis is expressed in the framework of Wald's famous Maximin paradigm for decision-making under strict uncertainty. We illustrate the subtlety required in modeling this paradigm by showing that information-gap's robustness model is in fact a Maximin model in disguise.
Dynamic Programming: an overview
The corridor method: a dynamic programming inspired metaheuristic
Preface
Page 1