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

heuristic algorithmslarge-scale optimizationpolynomial boundednessgeneralized upper boundsNP- hardnessbasis factorizationexploitation of special structureidentification of embedded network rowsmaximum-size embedded pure network

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 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
• The factorization approach to large-scale linear programming

Cited in

(16)

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

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)