An efficient scaling procedure for gain networks
- 1 January 1976
- Vol. 6 (2) , 151-159
- https://doi.org/10.1002/net.3230060207
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the equivalence of some generalized network problems to pure network problemsMathematical Programming, 1973
- Calculating Maximal Flows in a Network with Positive GainsOperations Research, 1973
- Maximal Flow with Gains through a Special NetworkOperations Research, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Optimum flows in general communication networksJournal of the Franklin Institute, 1967
- One-Pass Algorithms for Some Generalized Network ProblemsOperations Research, 1966
- Dynamic Programming of Optimum Flows in Lossy Communication NetsIEEE Transactions on Circuit Theory, 1966
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963
- New Methods in Mathematical Programming—Optimal Flow Through Networks with GainsOperations Research, 1962
- An Out-of-Kilter Method for Minimal-Cost Flow ProblemsJournal of the Society for Industrial and Applied Mathematics, 1961