Accession Number:

AD0636222

Title:

MAXIMAL TWO-WAY FLOWS

Descriptive Note:

Research memo.

Corporate Author:

VIRGINIA UNIV CHARLOTTESVILLE DEPT OF ECONOMICS

Personal Author(s):

Report Date:

1966-06-01

Pagination or Media Count:

19.0

Abstract:

The most familiar network flow problem is that of finding the maximal integer flow from a source s to a sink t in a network G. In this paper we discuss the problem of simultaneous flows from s to t and from t to s. The main result of this paper is a max-flow min-cut theorem for this type of problem. The method of proof used indicates a procedure for finding the maximal flows. Finally, the problem of feasibility is discussed.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE