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.

This publication has 0 references indexed in Scilit: