Calculating Maximum Entropy Flows in Networks
DOI10.1057/JORS.1993.68zbMATH Open0774.90028OpenAlexW4253426720MaRDI QIDQ5289350FDOQ5289350
Authors: T. T. Tanyimboh, A. B. Templeman 
Publication date: 23 August 1993
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/52105/
Recommendations
- Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
- Maximum flows in probabilistic networks
- Maximum entropy analysis of flow and reaction networks
- Entropy modeling of network structures
- Maximal flow in possibilistic networks
- Efficiently Computing Maximum Flows in Scale-Free Networks.
- On the Maximum Expected Flow in a Network
- Maximum entropy principle for Kaniadakis statistics and networks
- Entropy maximisation and queueing network models
Deterministic network models in operations research (90B10) Measures of information, entropy (94A17) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (9)
- Water supply network in a fuzzy environment; maximum entropy approach
- Statistical procedures for estimating branch flows and total network flow
- Controlled maximum entropy method optimization of the initial network topology and routing
- A Tsallis entropy-based redundancy measure for water distribution networks
- Maximum entropy analysis of flow and reaction networks
- Bayesian and maximum entropy analyses of flow networks with non-Gaussian priors and soft constraints
- Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
- Evaluation of water quality reliability based on entropy in water distribution system
- Optimal mixing in transport networks: numerical optimization and analysis
This page was built for publication: Calculating Maximum Entropy Flows in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289350)
