"Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for ..."

Daniel P. Heyman, Meredith J. Goldsmith (1995)

> Home

Details and statistics

DOI: 10.1287/IJOC.7.1.101

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/HeymanG95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/HeymanG95
Daniel P. Heyman, Meredith J. Goldsmith:
Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain. INFORMS J. Comput. 7(1): 101-108 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.