New labeling procedures for the basis graph in generalized networks

  • Authors:

  • Michael Engquist;Michael D Chang

  • Affiliations:

  • Department of General Business, College of Business Administration, The University of Texas at Austin, Austin, TX 78712, USA;Department of General Business, College of Business Administration, The University of Texas at Austin, Austin, TX 78712, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

Labeling procedures for the basis graph of a generalized network are introduced which build on procedures designed for pure networks. Computational results are presented which show that a primal simplex code which uses these procedures is about 60 times faster than a general purpose linear programming code.