THE NUMERICAL SOLUTION OF NETWORK PROBLEMS USING THE OUT-OF-KILTER ALGORITHM

Abstract

Network flow problems arise in the solution of transportation and scheduling problems. Divided into four substantially independent sections, this Memorandum: (1) reviews the types of problems that are representable as capacitated network problems; (2) explains (with diagrams) the out-of-kilter algorithm and techniques for implementing it on a computer; (3) describes modification of the algorithm to a two-phase algorithm; (4) presents a method for labeling the nodes by means of a scan list. Tentative conclusions are that the two-phase algorithm is undesirable, and that the labeling procedure shortens computer time at the cost of using more memory.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1968
Accession Number
AD0667528

Entities

People

  • R. J. Clasen

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Composite Materials
  • Computational Science
  • Computer Programming
  • Linear Programming
  • Scheduling (Production)
  • Three Dimensional
  • Transportation
  • United States

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Systems Analysis and Design