Finding Embedded Network Rows in Linear Programs I: Extraction Heuristics
| dc.contributor.author | Bixby, Robert E. | en_US |
| dc.contributor.author | Fourer, Robert | en_US |
| dc.date.accessioned | 2018-06-18T17:27:11Z | en_US |
| dc.date.available | 2018-06-18T17:27:11Z | en_US |
| dc.date.issued | 1986-08 | en_US |
| dc.date.note | August 1986 | en_US |
| dc.description.abstract | An embedded network within a linear program is, roughly speaking, a subset of constraints that represent conservation of flow. In this paper, we examine three broad classes of heuristic techniques - row-scanning deletion, column-scanning deletion, and row-scanning addition - for the extraction of large embedded networks. We describe a variety of implementations, and compare their performance on varied test problems. The success of our tests depends, in part, on several preprocessing steps that scale the constraint matrix and that set aside certain rows and columns. Efficiency of the subsequent network extraction is dependent on the implementation, in predictable ways. Effectiveness is harder to explain; the more sophisticated and expensive implementations seem to be more reliable, but much simpler implementations sometimes find equally large networks. The largest networks are obtained by applying a final augmentation phase, which is studied in the second part of this paper. | en_US |
| dc.format.extent | 67 pp | en_US |
| dc.identifier.citation | Bixby, Robert E. and Fourer, Robert. "Finding Embedded Network Rows in Linear Programs I: Extraction Heuristics." (1986) <a href="https://hdl.handle.net/1911/101605">https://hdl.handle.net/1911/101605</a>. | en_US |
| dc.identifier.digital | TR86-18 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/101605 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | Finding Embedded Network Rows in Linear Programs I: Extraction Heuristics | en_US |
| dc.type | Technical report | en_US |
| dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1