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

DOI10.1287/mnsc.26.11.1166zbMath0447.90058OpenAlexW2103642628MaRDI QIDQ3893666

David S. Thomen, Gerald G. Brown

Publication date: 1980

Published in: Management Science (Search for Journal in Brave)

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

zbMATH Keywords

generalized upper boundsNP- complete problemsautomatic identificationbasis factorization algorithmGUB structurelarge-scale optimization models

Mathematics Subject Classification ID

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

Related Items (9)

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

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