On Max Flows with Gains and Pure Min-Cost Flows
- 1 March 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 32 (2), 450-456
- https://doi.org/10.1137/0132037
Abstract
No abstract availableThis publication has 15 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
- The payment scheduling problemNaval Research Logistics Quarterly, 1972
- The Dual Method for the Generalized Transportation ProblemManagement Science, 1966
- The Generalized Stepping Stone Method for the Machine Loading ModelManagement Science, 1964
- 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