Extracting pure network submatrices in linear programs using signed graphs

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.

[1]  Gerald G. Brown,et al.  Automatic identification of embedded network rows in large-scale optimization models , 1984, Math. Program..

[2]  H. Markowitz.  The Elimination form of the Inverse and its Application to Linear Programming , 1957 .

[3]  Thomas Zaslavsky.  Glossary of Signed and Gain Graphs , 2002 .

[4]  Gerald G. Brown,et al.  Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models , 1980 .

[5]  F. Harary.  On the notion of balance of a signed graph. , 1953 .

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  R. Fourer,et al.  Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics , 1988 .

[8]  Thomas Zaslavsky,et al.  How colorful the signed graph? , 1984, Discret. Math..

[9]  Vangelis Th. Paschos.  A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem , 1992, Inf. Process. Lett..

[10]  Frank Harary,et al.  A simple algorithm to detect balance in signed graphs , 1980, Math. Soc. Sci..

[11]  Thomas Zaslavsky.  Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74 , 1983, Discret. Appl. Math..

[12]  Gautam Mitra,et al.  RISK AND RETURN ANALYSIS OF A MULTI­ PERIOD STRATEGIC PLANNING PROBLEM , 1997 .

[13]  Youssef Saab.  Iterative Improvement of Vertex Covers , 1995, Inf. Process. Lett..

[14]  Thomas Zaslavsky.  Signed graphs , 1982, Discret. Appl. Math..

[15]  Nalan Gülpinar,et al.  Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms , 2000, Comput. Optim. Appl..

[16]  Gautam Mitra,et al.  Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..

[17]  Robert E. Bixby,et al.  Converting Linear Programs to Network Problems , 1980, Math. Oper. Res..

[18]  John J. Bartholdi,et al.  A good submatrix is hard to find , 1982, Oper. Res. Lett..

[19]  I. Heller,et al.  14 . An Extension of a Theorem of Dantzig’s , 1957 .

[20]  G. Fandel,et al.  Lecture Notes in Economics and Mathematics Systems , 1997 .

[21]  Barrie M. Baker,et al.  A heuristic for finding embedded network structure in mathematical programmes , 1993 .