IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

A Survey of Algorithms for Convex Multicommodity Flow Problems

Listed author(s):
  • A. Ouorou


    (LIMOS---Université Blaise Pascal, ISIMA, BP 125, 63173 Aubière Cedex, France)

  • P. Mahey


    (LIMOS---Université Blaise Pascal, ISIMA, BP 125, 63173 Aubière Cedex, France)

  • J.-Ph. Vial


    (HEC, Section of Management Studies, University of Geneva, 102, Bd. Carl-Vogt, 1211 Geneva 4, Switzerland)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 46 (2000)
    Issue (Month): 1 (January)
    Pages: 126-147

    in new window

    Handle: RePEc:inm:ormnsc:v:46:y:2000:i:1:p:126-147
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. J. L. Goffin & A. Haurie & J. P. Vial, 1992. "Decomposition and Nondifferentiable Optimization with the Projective Algorithm," Management Science, INFORMS, vol. 38(2), pages 284-302, February.
    2. Gondzio, J. & Sarkissian, R. & Vial, J.-P., 1997. "Using an interior point method for the master problem in a decomposition approach," European Journal of Operational Research, Elsevier, vol. 101(3), pages 577-587, September.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:1:p:126-147. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.