Premium
A multicommodity flow problem
Author(s) -
Kant E.
Publication year - 1974
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230040306
Subject(s) - 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 , geometry , cartography , geography , structural engineering
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.