A new aggregation-disaggregation algorithm

DOI10.1016/0377-2217(93)E0171-SMaRDI QIDQ1388857zbMATH OpenFDO

Authors Tadayoshi Shioyama, Kimiyuki Tanaka

Publication date 11 June 1998

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Markov processesdecomposabilitylumpabilitybranch-and-bound methodKolmogoroff equationsaggregation-disaggregation methodlarge Markov chains

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1684368
• scientific article; zbMATH DE number 830005
• scientific article; zbMATH DE number 19229
• A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains

Cites work

• scientific article; zbMATH DE number 3574935 (Why is no real title available?)
• OPTIMIZATION IN PRODUCTION SYSTEMS: A SURVEY ON QUEUING APPROACHES

Cited in

(5)

• Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm
• A learning algorithm for source aggregation
• A probabilistic algorithm for aggregating vastly undersampled large Markov chains
• scientific article; zbMATH DE number 5716599 (Why is no real title available?)
• scientific article; zbMATH DE number 1684368 (Why is no real title available?)

This page was built for publication: A new aggregation-disaggregation algorithm

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