A new aggregation-disaggregation algorithm

DOI10.1016/0377-2217(93)E0171-SzbMath0899.90088MaRDI QIDQ1388857

Kimiyuki Tanaka, Tadayoshi Shioyama

Publication date: 11 June 1998

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

zbMATH Keywords

Markov processesdecomposabilitybranch-and-bound methodlumpabilityKolmogoroff equationsaggregation-disaggregation methodlarge Markov chains

Mathematics Subject Classification ID

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

Related Items (2)

Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm ⋮ A probabilistic algorithm for aggregating vastly undersampled large Markov chains

Cites Work

• Unnamed Item
• OPTIMIZATION IN PRODUCTION SYSTEMS: A SURVEY ON QUEUING APPROACHES

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