Calculating maximum entropy flows in networks

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

[thumbnail of Tanyimboh-Templeman-JORS1993-calculating-maximum-entropy-flows-in-networks]
Preview
Text (Tanyimboh-Templeman-JORS1993-calculating-maximum-entropy-flows-in-networks)
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.;