A scaled reduced gradient algorithm for network flow problems with convex separable costs
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 125-147
- https://doi.org/10.1007/bfb0120941
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Two-Segment Separable ProgrammingManagement Science, 1979
- Large-scale linearly constrained optimizationMathematical Programming, 1978
- Solving the Pipe Network Analysis Problem Using Optimization TechniquesManagement Science, 1978
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- New Finite Pivoting Rules for the Simplex MethodMathematics of Operations Research, 1977
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network CodeOperations Research, 1976
- Hydraulic network analysis using (generalized) geometric programmingNetworks, 1976
- Optimal Routing in a Packet-Switched Computer NetworkIEEE Transactions on Computers, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956