Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models

DOI10.1287/MNSC.26.11.1166MaRDI QIDQ3893666zbMATH OpenOpenAlexFDO

Authors Gerald G. Brown, David S. Thomen

Publication date 1980

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/39dcb8c1b7dd276bb91ec1c66c53fb7b95e18a7f

zbMATH Keywords

automatic identificationbasis factorization algorithmgeneralized upper boundsGUB structurelarge-scale optimization modelsNP- complete problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Cited in

(9)

• A network relaxation based enumeration algorithm for set partitioning
• Detecting embedded pure network structures in LP problems
• Dynamic factorization in large-scale optimization
• Extracting pure network submatrices in linear programs using signed graphs.
• Automatic identification of embedded network rows in large-scale optimization models
• Extracting embedded generalized networks from linear programming problems
• Use of hidden network structure in the set partitioning problem
• The practical conversion of linear programmes to network flow models
• Basis properties and algorithmic specializations for GUB transformed networks

This page was built for publication: Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models

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