Accession Number : AD0653117

Title :   COMPUTING TWO-COMMODITY FLOWS,

Corporate Author : VIRGINIA UNIV CHARLOTTESVILLE

Personal Author(s) : Rothschild,B. ; Whinston,A. ; Kent,J.

Report Date : APR 1967

Pagination or Media Count : 13

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.

Descriptors :   (*MINIMAX TECHNIQUE, COMPUTERS), ALGORITHMS, THEOREMS, NETWORKS, OPERATIONS RESEARCH, FLOW CHARTING

Subject Categories : Theoretical Mathematics
      Computer Hardware
      Computer Systems

Distribution Statement : APPROVED FOR PUBLIC RELEASE