Calculating Maximum Entropy Flows in Networks
本文提出了在数据不完整的网络中计算链路流最可能值的方法，构建了能处理多种网络问题的最大熵流估计框架，并用供水网络示例展示结果。
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.