A Primal Simplex Variant for the Maximum Flow Problem,

Abstract

This paper presents a number of specialized implementations of the primal simplex algorithm for the maximum flow problem. Computational results indicate that some of these variants are both faster and require less computer storage than our best implementation of the classic labeling algorithm for maximum flow problems. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1979
Accession Number
ADA084282

Entities

People

  • Darwin Dee Klingman
  • David Whitman
  • Fred W. Glover
  • John Mote

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computer Programs
  • Computers
  • Databases
  • Flow Network
  • Information Processing
  • Information Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Optimization
  • Probability Distributions
  • Simplex Method
  • Statistical Analysis
  • Topology

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Vision.
  • Virology (or Medical Virology).