A Survey of Algorithms for Convex Multicommodity Flow Problems

A. Ouorou (), P. Mahey () and J.-Ph. Vial ()
Additional contact information
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

Management Science, 2000, vol. 46, issue 1, 126-147

Abstract: 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.

Keywords: Network Optimization; Multicommodity Flows; Message Routing; Convex Programming (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.46.1.126.15132 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:46:y:2000:i:1:p:126-147

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().