COMPUTATION OF MAXIMAL FLOWS IN NETWORKS

Abstract

A simple computational method, based on the simplex algorithm of linear programming, is proposed for the following problem: 'Consider a network (e.g., rail, road, communication network) connecting two given points by way of a number of intermediate points, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given point to the other.'

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1955
Accession Number
AD0604709

Entities

People

  • D. R. Fulkerson
  • G. B. Dantzig

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computational Science
  • Computations
  • Computer Programming
  • Equations
  • Hard Copy
  • Linear Programming
  • Networks
  • Probability
  • Simplex Method
  • Steady State

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Fluid Dynamics.
  • Radio communications and signal processing.