Minimum‐cost flows in convex‐cost networks
- 1 March 1966
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 13 (1), 1-9
- https://doi.org/10.1002/nav.3800130102
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNSPublished by Defense Technical Information Center (DTIC) ,1960
- Increasing the Capacity of a Network: The Parametric Budget ProblemManagement Science, 1959
- An algorithm for solving the transportation problem when the shipping cost over each route is convexNaval Research Logistics Quarterly, 1959
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958
- Non-linear network problemsQuarterly of Applied Mathematics, 1956