Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions

DOI10.2307/2525455zbMath0121.15104OpenAlexW2318442875WikidataQ56913587 ScholiaQ56913587MaRDI QIDQ5732235

Albert Ando, Franklin M. Fisher

Publication date: 1963

Published in: International Economic Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2525455

zbMATH Keywords

operations research

Related Items (8)

Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods ⋮ A model of a time-sharing virtual memory system solved using equivalence and decomposition methods ⋮ The architecture of connectivity: a key to network vulnerability, complexity and resilience ⋮ Vulnerability, resilience and `systemic interest': a connectivity approach ⋮ A model of a virtual memory system ⋮ Discrete event simulation modelling of computer systems for performance evaluation ⋮ Near optimization of dynamic systems by decomposition and aggregation ⋮ A probabilistic algorithm for aggregating vastly undersampled large Markov chains

This page was built for publication: Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions