MULTICOMMODITY NETWORK FLOWS - SURVEY

被引：174

作者：

ASSAD, AA

机构：

[1] Massachusetts Institute of Technology, Cambridge, Massachusetts

来源：

NETWORKS | 1978年 / 8卷 / 01期

关键词：

D O I：

10.1002/net.3230080107

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. Copyright © 1978 Wiley Periodicals, Inc., A Wiley Company

引用

页码：37 / 91

页数：55

共 119 条

[1] Abadie J., Sakarovitch M., Two Methods of Decomposition for Linear Programs, (1970)
[2] Arinal J.C., Maximal Biflow in an Undirected Network, IBM Journal of Research and Development, 13, pp. 373-379, (1969)
[3] Assad A.A., Multicommodity Network Flows ‐ Computational Experience, (1976)
[4] Bellmore M., Bennington G., Lubore S., A Multivehicle Tanker Scheduling Problem, Transportation Science, 5, pp. 36-47, (1971)
[5] Bellmore M., Greenberg H.J., Jarvis J.J., Multicommodity Disconnecting Sets, Management Science, 16, pp. 427-433, (1970)
[6] Bellmore M., Ratliff H.D., Optimal Defense of Multicommodity Networks, Management Science, 18, pp. 174-185, (1971)
[7] Berge C., Ghouila-Houri A., Programming, Games, and Transportation Networks, (1962)
[8] Berge C., The Theory of Graphs and Its Applications, (1962)
[9] Best M.J., pp. 438-443, (1975)
[10] Boyer D.D., Hunt D.J., A Modified Simplex Algorithm for Solving the Multicommodity Flow Problem, (1968)

← 1 2 3 4 5 6 7 8 9 10 →