Detecting Embedded Networks in LP Using GUB Structures and IndependentSet Algorithms

Authors:
Nalân Gülpinar;Gregory Gutin;Gautam Mitra;István Maros
Affiliations:
Department of Mathematical Sciences, Brunel University, UK;Department of Mathematical Sciences, Brunel University, UK;Department of Mathematical Sciences, Brunel University, UK;Department of Computing, Imperial College, UK
Venue:
Computational Optimization and Applications
Year:
2000

Citing 6
Cited 2

Direct methods for sparse matrices

Direct methods for sparse matrices
Finding embedded network rows in linear programs. I. Extraction heuristics

Management Science
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A (&Dgr;/2)-approximation algorithm for the maximum independent set problem

Information Processing Letters
Dynamic factorization in large-scale optimization

Mathematical Programming: Series A and B
A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models

ACM Transactions on Mathematical Software (TOMS)

Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure

Computational Optimization and Applications
Extracting pure network submatrices in linear programs using signed graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an alternative multi-stagegeneralized upper bounds (GUB) based approach for detecting anembedded pure network structure in an LP problem. In order toidentify a GUB structure, we use two different approaches; the firstis based on the notion of Markowitz merit count and the secondexploits independent sets in the corresponding graphs. Ourcomputational experiments show that the multi-stage GUB algorithmbased on these approaches performs favourably when compared withother well known algorithms.