Optimal Node Visitation in Stochastic Digraphs

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

Theologos Bountourelis, Spyros A. Reveliotis

Publication date: 8 August 2017

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

Full work available at URL: https://doi.org/10.1109/tac.2008.2006932

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Markov and semi-Markov decision processes (90C40) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

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

This page was built for publication: Optimal Node Visitation in Stochastic Digraphs