New methods for multi-commodity flows

Title: New methods for multi-commodity flows
Creator: Boland, Natashia; Mees, A. I.
Relation: Computers and Mathematics with Applications Vol. 20, Issue 1, p. 29-38
Publisher Link: http://dx.doi.org/10.1016/0898-1221(90)90066-S
Publisher: Pergamon
Resource Type: journal article
Date: 1990
Description: Multi-commodity flow problems arise naturally in telecommunications and scheduling. Such applications typically involve large network optimization problems with constraints of a form which make standard optimization techniques inapplicable. Linear programming methods can solve only small instances of such problems. New theoretical work by Soviet researchers on network-based techniques is shown in this paper to yield practical algorithms which enable certain types of multi-commodity flow problems to be solved quickly. As these methods generalize efficient single-commodity methods, there is promise that further research will allow more general problems to be solved in an analogous manner.
Subject: multi-commodity; flow problems; linear programming methods; network-based techniques
Identifier: http://hdl.handle.net/1959.13/939549
Identifier: uon:12835
Identifier: ISSN:0898-1221
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format