Automatic identification of embedded network rows in large-scale optimization models

DOI10.1007/BF02591728MaRDI QIDQ3315283zbMATH OpenOpenAlexFDO

Authors Gerald G. Brown, William G. Wright

Publication date 1984

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591728

zbMATH Keywords

basis factorizationexploitation of special structuregeneralized upper boundsheuristic algorithmsidentification of embedded network rowslarge-scale optimizationmaximum-size embedded pure networkNP- hardnesspolynomial boundedness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3858846
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• Detecting embedded pure network structures in LP problems
• Creating advanced bases for large scale linear programs exploiting embedded network structure
• A heuristic for finding embedded network structure in mathematical programmes

Cites work

• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• Combinatorial Optimization: What is the State of the Art
• Converting Linear Programs to Network Problems
• Determining GUB sets via an invert agenda algorithm
• Generalized upper bounding techniques
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The factorization approach to large-scale linear programming

Cited in

(17)

• A network relaxation based enumeration algorithm for set partitioning
• A heuristic for finding embedded network structure in mathematical programmes
• Detecting embedded pure network structures in LP problems
• Dynamic factorization in large-scale optimization
• Extracting pure network submatrices in linear programs using signed graphs.
• Detecting embedded networks in LP using GUB structures and independent set algorithms
• scientific article; zbMATH DE number 3858846 (Why is no real title available?)
• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
• Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
• Extracting embedded generalized networks from linear programming problems
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• Use of hidden network structure in the set partitioning problem
• Creating advanced bases for large scale linear programs exploiting embedded network structure
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• An exact approach to the problem of extracting an embedded network matrix
• The practical conversion of linear programmes to network flow models
• A survey of dynamic network flows

This page was built for publication: Automatic identification of embedded network rows in large-scale optimization models

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