New Labeling Procedures for the Basis Graph in Generalized Networks.

Abstract

Labeling procedures for the basis graph of a generalized network are introduced which build on procedures designed for pure networks. The various cases which arise in updating the basis graph are presented, and the efficiency of the related primal simplex implementation is discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1984
Accession Number
ADA146217

Entities

People

  • M. D. Chang
  • M. Engquist

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Contracts
  • Efficiency
  • Governments
  • Heuristic Methods
  • Management Engineering
  • Management Planning And Control
  • Mathematics
  • Orientation (Direction)
  • Simplex Method
  • United States
  • United States Government
  • Universities

Readers

  • Operations Research