Multicommodity Network Flows with Probabilistic Losses
研究网络中弧段存在概率损失时，如何最大化多商品流的期望值，提出了一种弧链模型和改进的列生成算法，并给出了计算经验。
This paper considers the problem of maximizing the expected value of multicommodity flows in a network in which the arcs experience probabilistic loss rates. Consideration of probabilistic losses are relevant, particularly, in communication and transportation networks. An arc-chain formulation of the problem and an efficient algorithm for computing an optimal solution are provided. The algorithm involves a modified column generation technique for identifying a constrained chain. Computational experience with the algorithm is included.