Calculating maximum entropy flows in networks

Tools

Tanyimboh, T. T. and Templeman, A. B. (1993) Calculating maximum entropy flows in networks. Journal of the Operational Research Society, 44 (4). pp. 383-396. ISSN 0160-5682 (https://doi.org/10.2307/2584416)

[thumbnail of Tanyimboh-Templeman-JORS1993-calculating-maximum-entropy-flows-in-networks]
Preview
 Text. Filename: Tanyimboh_Templeman_JORS1993_calculating_maximum_entropy_flows_in_networks.pdf
Accepted Author Manuscript
Download (7MB)| Preview

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.

ORCID iDs

Tanyimboh, T. T. ORCID logoORCID: https://orcid.org/0000-0003-3741-7689 and Templeman, A. B.;
  • Item type:Article
    ID code:52105
    Dates:
    Date
    Event
    April 1993
    Published
    Notes: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
    Subjects:Science > Mathematics > Probabilities. Mathematical statistics
    Department:Faculty of Engineering > Civil and Environmental Engineering
    Depositing user: Pure Administrator
    Date deposited:05 Mar 2015 12:17
    Last modified:18 Nov 2024 01:08
    Related URLs:
    URI:https://strathprints.strath.ac.uk/id/eprint/52105
CORE (COnnecting REpositories)