Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems
Lists
Only you see this
Abstract
Solving Markov chains is, in general, difficult if the state space of the chain is very large (or infinite) and lacking a simple repeating structure. One alternative to solving such chains is to co...
BibTeX
@article{busic2012comparing,
author = {Ana Busic and Ingrid M. H. Vliegen and Alan Scheller-Wolf},
title = {{Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems}},
journal = {Math. Oper. Res.},
year = {2012},
doi = {10.1287/moor.1110.0533},
}Loading related content...