Calculating maximum entropy flows in networks

T. T. Tanyimboh, A. B. Templeman

Research output: Contribution to journalArticle

79 Citations (Scopus)
107 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)383-396
Number of pages14
JournalJournal of the Operational Research Society
Volume44
Issue number4
DOIs
Publication statusPublished - Apr 1993

Keywords

  • networks
  • information theory
  • engineering
  • probability

Fingerprint Dive into the research topics of 'Calculating maximum entropy flows in networks'. Together they form a unique fingerprint.

  • Research Output

    • 79 Citations
    • 1 Article

    Maximum entropy flows for single-source networks

    Tanyimboh, T. T. & Templeman, A. B., 1993, In : Engineering Optimization. 22, 1, p. 49-63 15 p.

    Research output: Contribution to journalArticle

    Open Access
    File
  • 46 Citations (Scopus)
    94 Downloads (Pure)

    Cite this