Extensions of the Augmented Predecessor Index Method to Generalized Network Problems

Abstract

The augmented predecessor indexing method is a procedure for efficiently updating the basis representation, flows and node potentials in an adjacent extreme point (or 'simplex' type) method for network problems, using ideas due to Ellis Johnson in his proposed application of a triple-label representation to networks. The procedure is extended here to accommodate the more complex basis structures and updating processes of the generalized network problem, specifying rules for expediting the calculations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1973
Accession Number
AD0763382

Entities

People

  • Darwin Dee Klingman
  • Fred W. Glover
  • J. Stutz

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commerce
  • Computational Processes
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Equations
  • Inequalities
  • Linear Programming
  • Lists (Data Structures)
  • Operations Research
  • Orientation (Direction)
  • Simplex Method
  • Transportation
  • United States
  • Universities

Readers

  • Operations Research