You are not currently logged in.
Access JSTOR through your library or other institution:
Calculating Maximum Entropy Flows in Networks
T. T. Tanyimboh and A. B. Templeman
The Journal of the Operational Research Society
Vol. 44, No. 4, New Research Directions (Apr., 1993), pp. 383-396
Stable URL: http://www.jstor.org/stable/2584416
Page Count: 14
You can always find the topics here!Topics: Entropy, Probabilities, Conditional probabilities, Operations research, Water supply, Traffic estimation, Probability distributions, Flow velocity, Shannon entropy, Equilibrium equations
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
The Journal of the Operational Research Society © 1993 Operational Research Society