Computational Performance Bounds for Markov Chains With Applications
From MaRDI portal
Publication:4974248
DOI10.1109/TAC.2008.921013zbMath1367.90043MaRDI QIDQ4974248
P. R. Kumar, James R. Morrison
Publication date: 8 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Linear programming (90C05) Queues and service in operations research (90B22) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items (3)
Approximate linear programming for networks: average cost bounds ⋮ Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks ⋮ Computing Stationary Expectations in Level-Dependent QBD Processes
This page was built for publication: Computational Performance Bounds for Markov Chains With Applications