Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

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
DOI: 10.2307/2584416
Stable URL: http://www.jstor.org/stable/2584416
Page Count: 14
  • Get Access
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Calculating Maximum Entropy Flows in Networks
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
383
    383
  • Thumbnail: Page 
384
    384
  • Thumbnail: Page 
385
    385
  • Thumbnail: Page 
386
    386
  • Thumbnail: Page 
387
    387
  • Thumbnail: Page 
388
    388
  • Thumbnail: Page 
389
    389
  • Thumbnail: Page 
390
    390
  • Thumbnail: Page 
391
    391
  • Thumbnail: Page 
392
    392
  • Thumbnail: Page 
393
    393
  • Thumbnail: Page 
394
    394
  • Thumbnail: Page 
395
    395
  • Thumbnail: Page 
396
    396