Progress Made in Solving the Multicommodity Flow Problem

Authors:
Richard D. McBride
Affiliations:
-
Venue:
SIAM Journal on Optimization
Year:
1998

Citing 0
Cited 5

Parallel algorithm for the routing problem: an implementation in the parallel computer IBM-SP2

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows

VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Throughput-centric routing algorithm design

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the past few years, steady progress has been made in solving the multicommodity flow problem using EMNET, a primal partitioning network simplex algorithm. This paper describes a recent improvement made to EMNET which permits it to dramatically reduce the solution time for multicommodity flow problems with large numbers of side constraints. It is now possible to efficiently solve extremely large multicommodity flow problems when this new idea is coupled with the resource-directive decomposition heuristic as found in EMNET. Commercial problems with the number of constraints ranging up to 600,000 are routinely solved by EMNET.