MAXIMAL TWO-WAY FLOWS

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1966
Accession Number
AD0636222

Entities

People

  • A. Whinston
  • B. Rothschild

Organizations

  • University of Virginia

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Analogs
  • Availability
  • Classification
  • Commerce
  • Contractors
  • Contracts
  • Economics
  • Governments
  • Instructions
  • Military Research
  • Security
  • Universities
  • Virginia

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design