JOURNAL ARTICLE
A multicommodity flow problem
Year: 1974 Journal: Networks Vol: 4 (3)Pages: 267-280 Publisher: Wiley
Abstract
Abstract This paper presents an algorithm for finding maximal sized sets of flows in a certain class of multicommodity flow networks. The class consists of networks with integer capacity edges and with each node being a source or sink for all but at most one commodity. This new procedure lifts a restriction in a previous algorithm that required flow in edges joining source and sink of the same commodity.
Keywords:
Multi-commodity flow problem Flow network Mathematical optimization Sink (geography) Mathematics Minimum-cost flow problem Flow (mathematics) Integer programming Maximum flow problem Node (physics) Computer science Engineering
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
2
Refs
0.13
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Optimization and Packing Problems
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Optimization and Search Problems
Physical Sciences → Computer Science → Computer Networks and Communications
Related Documents
JOURNAL ARTICLE
Multicommodity flow problem
Journal: Journal of Mathematical Sciences Year: 1993 Vol: 65 (1)Pages: 1462-1464
JOURNAL ARTICLE
The stochastic multicommodity flow problem
Hossein SoroushPitu B. Mirchandani
Journal: Networks Year: 1990 Vol: 20 (2)Pages: 121-155
BOOK-CHAPTER
The Quickest Multicommodity Flow Problem
Lecture notes in computer science Year: 2002 Pages: 36-53