A Survey of Algorithms for Convex Multicommodity Flow Problems

Authors:
A. Ouorou;P. Mahey;J.-Ph. Vial
Affiliations:
-;-;-
Venue:
Management Science
Year:
2000

Citing 0
Cited 14

Capacity and flow assignment of data networks by generalized Benders decomposition

Journal of Global Optimization
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing

Computational Optimization and Applications
Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

Operations Research
End-to-end delay margin balancing approach for routing in multi-class networks

Wireless Networks
A proximal subgradient projection algorithm for linearly constrained strictly convex problems

Optimization Methods & Software
A two-stage stochastic programming model for transportation network protection

Computers and Operations Research
Model of optimal paths design for GMPLS network and evaluation of solution

WSEAS TRANSACTIONS on SYSTEMS
Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method

ICS'08 Proceedings of the 12th WSEAS international conference on Systems
A bundle-type algorithm for routing in telecommunication data networks

Computational Optimization and Applications
Discrete capacity and flow assignment algorithms with performance guarantee

Computer Communications
Bounds for global optimization of capacity expansion and flow assignment problems

Operations Research Letters
Optimal Location of Data Centers and Software Components in Cloud Computing Network Design

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
The Stiff Is Moving---Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment*

Transportation Science

Quantified Score

Hi-index	0.01

Visualization

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.