A Survey of Algorithms for Convex Multicommodity Flow Problems
综述了凸多商品流问题的求解技术，重点讨论数据网络中的消息路由问题，并通过四种技术进行数值实验，对网络优化研究者有参考价值。
Routing problems appear frequently when dealing with the operation of communication or transportation networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation for this work comes from this problem which is shown to belong to the class of nonlinear convex multicommodity flow problems. This paper emphasizes the message routing problem in data networks, but it includes a broader literature overview of convex multicommodity flow problems. We present and discuss the main solution techniques proposed for solving this class of large-scale convex optimization problems. We conduct some numerical experiments on the message routing problem with four different techniques.