Extracting pure network submatrices in linear programs using signed graphs

Authors:
N. Gülpinar;G. Gutin;G. Mitra;A. Zverovitch
Affiliations:
Department of Computing, Imperial College of Science, Technology and Medicine, University of London, 180 Queen's Gate, London SW7 2BZ, UK;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK;Department of Mathematical Sciences, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 5
Cited 5

Finding embedded network rows in linear programs. I. Extraction heuristics

Management Science
Introduction to algorithms

Introduction to algorithms
A (&Dgr;/2)-approximation algorithm for the maximum independent set problem

Information Processing Letters
Iterative improvement of vertex covers

Information Processing Letters
Detecting Embedded Networks in LP Using GUB Structures and IndependentSet Algorithms

Computational Optimization and Applications

An exact approach to the problem of extracting an embedded network matrix

Computers and Operations Research
Three-Index linear programs with nested structure

Automation and Remote Control
Multi-index transport problems with decomposition structure

Automation and Remote Control
Multiindex transportation problems with 2-embedded structure

Automation and Remote Control
Maximum balanced subgraph problem parameterized above lower bound

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.