DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0653117
Title:
COMPUTING TWO-COMMODITY FLOWS,
Descriptive Note:
Corporate Author:
VIRGINIA UNIV CHARLOTTESVILLE
Report Date:
1967-04-01
Pagination or Media Count:
13.0
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.
Distribution Statement:
APPROVED FOR PUBLIC RELEASE