COMPUTATION OF MAXIMUM FLOWS IN NETWORKS

Abstract

A review of the current theory and methods for the computation of maximum flow in networks is presented along with a simplified method for determination of a feasible flow in networks with upper and lower bounded arcs. A computational procedure is presented which is used to calculate the maximum flow for a general network. The network is reduced to an equivalent basic network. An associated network is used to compute a feasible, then the maximum flow for the basic network. A computer program is included for use in computation of maximal flows in large networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1968
Accession Number
AD0838959

Entities

People

  • William C. Burns

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computational Science
  • Computations
  • Computer Programs
  • Computers
  • Equations
  • Flow Network
  • Government (Foreign)
  • Literature
  • Mathematical Analysis
  • Networks
  • Numbers
  • Operations Research
  • Real Numbers
  • Steady State
  • United States

Readers

  • Operations Research