Optimal aggregation of components for the solution of Markov regenerative processes

DOI10.1007/978-3-319-43425-4_2MaRDI QIDQ1693111zbMATH OpenOpenAlexFDO

Authors Elvio Gilberto Amparore, S. Donatelli

Publication date 11 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43425-4_2

zbMATH Keywords

greedy algorithminteger linear programming problemMarkov chainnon-ergodic Markov renewal processes

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Markov renewal processes, semi-Markov processes (60K15) Integer programming (90C10)

Recommendations

• Revisiting the matrix-free solution of Markov regenerative processes.
• Posterior bounds on the equilibrium distribution of a finite markov chain
• A time aggregation approach to Markov decision processes
• Exploiting non-deterministic analysis in the integration of transient solution techniques for Markov regenerative processes
• Singularly perturbed Markov decision processes: a multiresolution algorithm

Cited in

(2)

• Revisiting the matrix-free solution of Markov regenerative processes.
• Optimal Kullback-Leibler Aggregation via Spectral Theory of Markov Chains

This page was built for publication: Optimal aggregation of components for the solution of Markov regenerative processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693111)