ON TWO COMMODITY NETWORK FLOWS.

Abstract

The paper considers the problem of two-commodity network flows and generalizes a result of Hu on integral flows in networks with integral capacities. The main result of the paper is a Max-flow Min-cut theorem for two commodity networks. The method of proof involves a particular type of separation process. This leads to an algorithm for finding the maximal flows. Several counterexamples to certain possible generalizations are given at the end of the paper. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1965
Accession Number
AD0624500

Entities

People

  • A. Whinston
  • B. Rothschild

Organizations

  • University of Virginia

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Integrals
  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Industrial Economics