COMPUTING TWO-COMMODITY FLOWS,

Abstract

In a max-flow min-cut theorem for two-commodity flows in Euler networks with integer capacities is proved. The paper describes an algorithm for constructing maximal two-commodity integer flows based on proof and computation times for some examples on a Burroughs B-5000 computer are given.

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1967
Accession Number
AD0653117

Entities

People

  • A. Whinston
  • B. Rothschild
  • J. Kent

Organizations

  • University of Virginia

Tags

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Commodities
  • Computational Complexity
  • Computations
  • Computers
  • Cooperation
  • Mathematical Analysis
  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research