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...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 137; no. 3; pp. 359 - 372
Main Authors Gülpinar, N, Gutin, G, Mitra, G, Zverovitch, A
Format Journal Article
LanguageEnglish
Published Lausanne Elsevier B.V 15.03.2004
Amsterdam Elsevier
New York, NY
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Graph theory
Linear programs
Mathematical programming
Mathematics
Networks
Operational research and scientific management
Operational research. Management science
Sciences and techniques of general use
Signed graphs
Theoretical computing
Networks
Linear programs
Signed graphs
Signed graph
Balancing
Computer theory
Network
Subgraph
Linear programming
Computational complexity
Linear graph
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(03)00361-5