Calculating Maximum Entropy Flows in Networks
This paper describes methods for calculating the most likely values of link flows in networks with incomplete data. The object is to present a thorough and rigorous treatment of maximum entropy flow estimation methods and to develop a methodological framework capable of handling different types of n...
Veröffentlicht in: | The Journal of the Operational Research Society. - Taylor & Francis, Ltd.. - 44(1993), 4, Seite 383-396 |
---|---|
1. Verfasser: | |
Weitere Verfasser: | |
Format: | Online-Aufsatz |
Sprache: | English |
Veröffentlicht: |
1993
|
Zugriff auf das übergeordnete Werk: | The Journal of the Operational Research Society |
Schlagworte: | Networks Information Theory Engineering Probability Physical sciences Mathematics Behavioral sciences Applied sciences |
Zusammenfassung: | This paper describes methods for calculating the most likely values of link flows in networks with incomplete data. The object is to present a thorough and rigorous treatment of maximum entropy flow estimation methods and to develop a methodological framework capable of handling different types of network problems. A multiple probability space conditional entropy approach is described for the general network problem. Results are presented and discussed for an example network intended for water supply. |
---|---|
ISSN: | 14769360 |
DOI: | 10.2307/2584416 |