Extracting pure network submatrices in linear programs using signed graphs Original Research Article

It is shown that the problem of detecting a maximum embedded network in a linear program is related to balancing of subgraphs of signed graphs. This approach leads to a simple efficient heuristic to extract an embedded network. The proposed heuristic also determines whether a given linear program is a (reflected) network itself. Some complexity results are obtained and computational results are also reported.