ISSN:
1573-2894
Keywords:
linear programming
;
generalized upper bounds
;
network programming
;
independent sets
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract In this paper, we present an alternative multi-stage generalized upper bounds (GUB) based approach for detecting an embedded pure network structure in an LP problem. In order to identify a GUB structure, we use two different approaches; the first is based on the notion of Markowitz merit count and the second exploits independent sets in the corresponding graphs. Our computational experiments show that the multi-stage GUB algorithm based on these approaches performs favourably when compared with other well known algorithms.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008791601215
Permalink