Premium
Multicommodity network flows—A survey
Author(s) -
Assad A. A.
Publication year - 1978
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.3230080107
Subject(s) - flow network , computer science , mathematical optimization , variety (cybernetics) , dual (grammatical number) , decomposition , linear programming , network planning and design , nonlinear system , traffic flow (computer networking) , operations research , mathematics , algorithm , computer network , artificial intelligence , art , ecology , physics , literature , quantum mechanics , biology
This report aims at a comprehensive survey of the literature dealing with the multicommodity flow problem. This problem arises naturally in network modelling wherever commodities, vehicles, or messages are to be shipped or transmitted from certain nodes of an underlying network to some others. Recent applications of mathematical programming techniques to traffic equilibrium problems in transportation studies as well as computer networks analysis has renewed considerable interest in this problem. This report discusses solution techniques for both linear and nonlinear flow problems. The former includes decomposition, partitioning, compact inverse methods, and primal‐dual algorithms. We describe a variety of feasible direction methods for the latter. The report concludes by giving applications and computational experience for both types of problems.