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

DOI10.1007/BF02591728zbMath0532.90076MaRDI QIDQ3315283

William G. Wright, Gerald G. Brown

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

large-scale optimization; heuristic algorithms; polynomial boundedness; generalized upper bounds; NP- hardness; basis factorization; exploitation of special structure; identification of embedded network rows; maximum-size embedded pure network

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90C11: Mixed integer programming

Related Items

The practical conversion of linear programmes to network flow models, A survey of dynamic network flows, 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., Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs, Extracting embedded generalized networks from linear programming problems

Cites Work

• Unnamed Item
• Generalized upper bounding techniques
• Combinatorial Optimization: What is the State of the Art
• Converting Linear Programs to Network Problems
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• Determining GUB sets via an invert agenda algorithm
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• The factorization approach to large-scale linear programming