Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics

DOI10.1287/MNSC.34.3.342MaRDI QIDQ3780758zbMATH OpenOpenAlexFDO

Authors Robert Fourer, Robert E. Bixby

Publication date 1988

Published in Management Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1911/101605

zbMATH Keywords

heuristic techniquescolumn-scanning deletionlarge embedded networksrow-scanning additionrow-scanning deletion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35)

Recommendations

• Automatic identification of embedded network rows in large-scale optimization models
• Detecting embedded pure network structures in LP problems
• Detecting embedded networks in LP using GUB structures and independent set algorithms
• Extracting embedded generalized networks from linear programming problems
• A heuristic for finding embedded network structure in mathematical programmes

Cited in

(18)

• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Implementing an LU factorization for the embedded network simplex algorithm
• Detecting embedded pure network structures in LP problems
• Use of hidden network structure in the set partitioning problem
• Solving embedded generalized network problems
• Dynamic factorization in large-scale optimization
• Extracting embedded generalized networks from linear programming problems
• Automatic identification of embedded network rows in large-scale optimization models
• A smooth penalty function algorithm for network-structured problems
• A heuristic for finding embedded network structure in mathematical programmes
• Computational implementation of Fujishige's graph realizability algorithm
• AXIS: A framework for interactively combining structured algorithms and knowledge based systems
• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
• The structure of bases in bicircular matroids
• A survey of dynamic network flows
• An exact approach to the problem of extracting an embedded network matrix
• Extracting pure network submatrices in linear programs using signed graphs.
• Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs

Describes a project that uses

Uses Software

• MINOS

This page was built for publication: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780758)