Calculating maximum entropy flows in networks

T. T. Tanyimboh, A. B. Templeman

Research output: Contribution to journalArticle

73 Citations (Scopus)

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.
LanguageEnglish
Pages383-396
Number of pages14
JournalJournal of the Operational Research Society
Volume44
Issue number4
DOIs
Publication statusPublished - Apr 1993

Fingerprint

Entropy
Water supply
Maximum entropy

Keywords

  • networks
  • information theory
  • engineering
  • probability

Cite this

Tanyimboh, T. T. ; Templeman, A. B. / Calculating maximum entropy flows in networks. In: Journal of the Operational Research Society. 1993 ; Vol. 44, No. 4. pp. 383-396.
@article{9fa55413b38b4b27960bf29d85302862,
title = "Calculating maximum entropy flows in networks",
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.",
keywords = "networks, information theory, engineering, probability",
author = "Tanyimboh, {T. T.} and Templeman, {A. B.}",
note = "This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version 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, is available online at: http://www.jstor.org/stable/2584416",
year = "1993",
month = "4",
doi = "10.2307/2584416",
language = "English",
volume = "44",
pages = "383--396",
journal = "Journal of Operational Research Society",
issn = "0160-5682",
number = "4",

}

Calculating maximum entropy flows in networks. / Tanyimboh, T. T.; Templeman, A. B.

In: Journal of the Operational Research Society, Vol. 44, No. 4, 04.1993, p. 383-396.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Calculating maximum entropy flows in networks

AU - Tanyimboh, T. T.

AU - Templeman, A. B.

N1 - This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version 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, is available online at: http://www.jstor.org/stable/2584416

PY - 1993/4

Y1 - 1993/4

N2 - 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.

AB - 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.

KW - networks

KW - information theory

KW - engineering

KW - probability

UR - http://www.jstor.org/action/showPublication?journalCode=joperresesoci

U2 - 10.2307/2584416

DO - 10.2307/2584416

M3 - Article

VL - 44

SP - 383

EP - 396

JO - Journal of Operational Research Society

T2 - Journal of Operational Research Society

JF - Journal of Operational Research Society

SN - 0160-5682

IS - 4

ER -