A Survey of Algorithms for Convex Multicommodity Flow Problems

  • Cahiers de recherche; 1997.13
Publication date1997

There are many problems related to the design of 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 orverview 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 experimets on the message routing problem with some different techniques

Citation (ISO format)
OUOROU, Adamou, MAHEY, P., VIAL, Jean-Philippe. A Survey of Algorithms for Convex Multicommodity Flow Problems. 1997
  • PID : unige:5920

Technical informations

Creation04/15/2010 12:21:14 PM
First validation04/15/2010 12:21:14 PM
Update time03/14/2023 3:27:02 PM
Status update03/14/2023 3:27:02 PM
Last indexation01/15/2024 7:46:08 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack