Static flows in networks (Q1100084)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Static flows in networks |
scientific article |
Statements
Static flows in networks (English)
0 references
1987
0 references
We survey the results obtained in recent years in connection with problems of homogeneous flows in networks. We consider the classification of problems and algorithms, the theoretical results on cycling and stalling in primal simplex network algorithms, and methods of construction of dual algorithms that are optimal in a certain sense. Construction of maximum flows in networks is described in detail and the comparative efficiency of the corresponding methods is analyzed. Reduction of some linear programming problems to network flow problems is discussed.
0 references
survey
0 references
homogeneous flows in networks
0 references
cycling
0 references
stalling
0 references
primal simplex network algorithms
0 references
dual algorithms
0 references
maximum flows
0 references