An embedded network within a linear program is, roughly speaking, a subset of constraints that represent conservation of flow. We examine three broad classes of heuristic techniques - row-scanning deletion, column-scanning deletion, and row-scanning addition - for extraction of large embedded networks. We present a variety of implementations, and compare their performance on realistic test problems.
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research