Optimal Node Visitation in Stochastic Digraphs

DOI10.1109/TAC.2008.2006932zbMath1367.90014MaRDI QIDQ4974402

Theologos Bountourelis, Spyros A. Reveliotis

Publication date: 8 August 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B15: Stochastic network models in operations research

90C40: Markov and semi-Markov decision processes

05C20: Directed graphs (digraphs), tournaments

Related Items

On polynomial cases of the unichain classification problem for Markov decision processes