Accession Number:

AD0636514

Title:

MINIMUM-COST FLOWS IN CONVEX-COST NETWORKS

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV BERKELEY

Personal Author(s):

Report Date:

1966-03-01

Pagination or Media Count:

10.0

Abstract:

An algorithm is given for solving minimum-cost flow problems where the shipping cost over an arc is 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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE