Minimum Convex-Cost Flows in Networks.

T. C. Hu

ResearchPublished 1964

The Memorandum employs an algorithm 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 technique provides a unified way of looking at many seemingly unrelated problems. For example, problems associated with electrical networks, an increased network capacity under a fixed budget, Laplace equations, and the Max-Flow Min-Cut Theorem may all be formulated into minimum convex-cost flow problems. 26 pp. Bibliog

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1964
  • Pages: 26
  • Document Number: RM-4265-PR

Citation

Chicago Manual of Style

Hu, T. C., Minimum Convex-Cost Flows in Networks. Santa Monica, CA: RAND Corporation, 1964. https://www.rand.org/pubs/research_memoranda/RM4265.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.