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.

• 저널Management Science · 46(1) · 126–147
• 토픽Smart Parking Systems Research · Building and Construction
• DOI10.1287/mnsc.46.1.126.15132
• 저자Adam Ouorou, Philippe Mahey, Jean-Philippe Vial