The structure of bases in bicircular matroids (Q912110)

A generalized network flow problem (GNF) is a linear program with at most two nonzero entries in the constraint matrix; not exactly two, like in the pure network flow problem (PNF). Due to its special structure, even the former can be performed much faster than the general linear programming problems. A ``hidden'' PNF in an LP problem can be recognized [see, for example, \textit{R. E. Bixby} and \textit{W. Cunningham}, Converting linear programs to network problems, Math. Oper. Res. 5, 322-357 (1980; Zbl 0442.90095)]. The present paper and some forthcoming ones give a recognition algorithm for GNF under some condition.