MINIMUM CONVEX-COST FLOWS IN NETWORKS

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. For example, 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 convex-cost flow problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1964
Accession Number
AD0608270

Entities

People

  • T. C. Hu

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Boundary Value Problems
  • Difference Equations
  • Differential Equations
  • Electrical Networks
  • Equations
  • Networks

Readers

  • Atmospheric Science/Meteorology
  • Graph Algorithms and Convex Optimization.
  • Software Engineering