An algorithm for optimizing network flow capacity under economies of scale
- 1 May 1975
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 15 (5) , 565-586
- https://doi.org/10.1007/bf00933746
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Characterization of local solutions for a class of nonconvex programsJournal of Optimization Theory and Applications, 1975
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex ConstraintsManagement Science, 1971
- Minimum cost routing for static network modelsNetworks, 1971
- The Validity of a Family of Optimization MethodsSIAM Journal on Control, 1970
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969
- Iterative Solution of Nonlinear Optimal Control ProblemsSIAM Journal on Control, 1966
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- Increasing the Capacity of a Network: The Parametric Budget ProblemManagement Science, 1959