FINDING EMBEDDED NETWORK ROWS IN LINEAR PROGRAMS I. EXTRACTION HEURISTICS.

Robert E. Bixby*, Robert Fourer

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)342-376
Number of pages35
JournalManagement Science
Volume34
Issue number3
DOIs
StatePublished - 1988

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'FINDING EMBEDDED NETWORK ROWS IN LINEAR PROGRAMS I. EXTRACTION HEURISTICS.'. Together they form a unique fingerprint.

Cite this