Minimum‐cost flows in convex‐cost networks

T. C. Hu

Naval Research Logistics Quarterly, 1966, vol. 13, issue 1, 1-9

Abstract: An algorithm is given for solving minimum‐cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max‐Flow Min‐Cut Theorem may all be formulated into minimum‐cost flow problems in convex‐cost networks.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800130102

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:13:y:1966:i:1:p:1-9

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().