Finding Equivalent Network Formulations for Constrained Network Problems

Abstract

The paper describes a procedure for determining if constrained network problems (i.e., network problems with additional linear constraints) can be transformed into equivalent pure network problems by a linear transformation involving the node constraints and the extra constraints. The results extend procedures for problems in which the extra constraints consist of bounding certain partial sums of variables.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1973
Accession Number
AD0774030

Entities

People

  • Darwin Dee Klingman
  • G. T. Ross Jr.

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Commerce
  • Computer Programming
  • Customer Services
  • Equations
  • Inequalities
  • Linear Programming
  • Military Research
  • Numbers
  • Real Numbers
  • Standards
  • Transportation
  • Universities

Readers

  • Operations Research