Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
Year of publication: |
2005
|
---|---|
Authors: | Pekergin, Nihal ; Dayar, Tugrul ; Alparslan, Denizhan N. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 165.2005, 3, p. 810-825
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Iterative methods based on splittings for stochastic automatanetworks
Uysal, Ertugrul, (1998)
-
Lumpable continuous-time stochastic automata networks
Gusak, Oleg, (2003)
-
Iterative methods based on splittings for stochastic automata networks
Uysal, Ertugrul, (1998)
- More ...