search query: @author Bixby, R. E. / total: 1
reference: 1 / 1
« previous | next »
Author: | Bixby, R. E. Fourer, R. |
Title: | Finding embedded network rows in linear programs I : Extraction heuristics. |
Journal: | Management Science
1988 : MAR, VOL. 34:3, p. 342-376 |
Index terms: | LINEAR PROGRAMMING NETWORKS HEURISTIC METHODS |
Language: | eng |
Abstract: | An embedded network within a linear program is a subset of constraints that represent conservation of flow. There are examined three broad classes of heuristic techniques - row-scanning deletion, column-scanning deletion, and row-scanning addition - for the extraction of large embedded networks. A variety of implementations is presented, and compared their performance on realistic test problems. The success of the tests depends in part on several preprocessing steps that scale the constraint matrix. |
« previous | next »
SCIMA