1. Connectedness conditions for denumerable state Markovian decision processes;Thomas,1980
2. Non-discounted denumerable Markovian decision models;Ross;Ann. Math. Statist.,1968
3. Discrete dynamic programming with unbounded rewards;Harrison;Ann. Math. Statist.,1972
4. Recurrence conditions in denumerable state Markov decision processes;Federgruen,1978
5. CTMDP and its relationship with DTMDP;Hu;Chinese Sci. Bull.,1990