CONSTRUCTION OF MAXIMAL DYNAMIC FLOWS IN NETWORKS

Abstract

This note describes briefly an algorithm for solving the following problem. Suppose given a network (linear graph) in which each link has associated with it two positive integers, one a commodity flow capacity, the other a traversal time. Assuming that some node of the network is a source for the commodity, another a sink, and the remaining may either transship the commodity immediately on receipt or hold for later shipment, what is the maximal amount that can be shipped from source to sink in any given number of time periods. No proofs are given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 07, 1957
Accession Number
AD0606376

Entities

People

  • Jr. R. Ford L. R.

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Computational Science
  • Computations
  • Heuristic Methods
  • Inequalities
  • Integrals
  • Linear Programming
  • Logistics
  • Mathematics
  • Naval Logistics
  • New York
  • Simplex Method
  • Steady State
  • Supply Chain Management
  • Time Intervals

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Logistics and Supply Chain Management.
  • Mathematical Modeling and Probability Theory.