On the Simplex Method for Networks with Side Variables

Many algorithms for network LP's with non-network (side) variables maintain a working basis for the basic non-network (side) variables and a tree or forest data structure for the basic network (arc) variables. A new variation on this theme will be presented which is a more natural extension of the pure network simplex method.