A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

Abstract

A very simple algorithm for finding a maximal flow and minimal cut in a transportation network is described; it is then applied to obtain an efficient computational routine for the Hitchcock distribution problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 29, 1955
Accession Number
AD0224376

Entities

People

  • D. R. Fulkerson
  • L. R. Ford Jr.

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Corporations
  • Equations
  • Flow Network
  • Heuristic Methods
  • Linear Programming
  • Logistics
  • Network Science
  • New York
  • Procurement
  • Sequences
  • Shipping
  • Simplex Method
  • Steady State
  • Transportation

Fields of Study

  • Mathematics

Readers

  • Operations Research