A Survey of Algorithms for Convex Multicommodity Flow Problems

A. Ouorou, P. Mahey and P.ph. Vial

Working Papers from Ecole des Hautes Etudes Commerciales, Universite de Geneve-

Abstract: There are many problems related to design a networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation of this work comes from this problem which is shown to belong to the lass of nonlinear convex multicomodity flow problems.

Keywords: NETWORKS; MANAGEMENT; DATA (search for similar items in EconPapers)
JEL-codes: C60 C61 (search for similar items in EconPapers)
Pages: 27 pages
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:fth:ehecge:97.13

Access Statistics for this paper

More papers in Working Papers from Ecole des Hautes Etudes Commerciales, Universite de Geneve- Suisse; Ecole des Hautes Etudes Commerciales, Universite de Geneve, faculte des SES. 102 Bb. Carl-Vogt CH - 1211 Geneve 4, Suisse. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().