Adjacent extreme flows and application to min concave cost flow problems
- 1 June 1979
- Vol. 9 (2), 95-121
- https://doi.org/10.1002/net.3230090202
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- On building minimum cost communication networks over timeNetworks, 1974
- Concave minimization over a convex polyhedronNaval Research Logistics Quarterly, 1973
- On building minimum cost communication networksNetworks, 1973
- Minimum cost routing for static network modelsNetworks, 1971
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Minimum Concave Cost Flows in Certain NetworksManagement Science, 1968
- Networks and Basic SolutionsOperations Research, 1966
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963