Detecting embedded pure network structures in LP problems

DOI10.1007/BF02564799MaRDI QIDQ1265245zbMATH OpenOpenAlexWikidataFDO

Authors Gautam Mitra, Nalân Gülpinar, István Maros

Publication date 27 October 1998

Published in Top (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingnetwork optimizationnetwork structuresembedded networkembedded pure networkGUB based algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Detecting embedded networks in LP using GUB structures and independent set algorithms
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• Automatic identification of embedded network rows in large-scale optimization models
• Extracting embedded generalized networks from linear programming problems
• Extracting pure network submatrices in linear programs using signed graphs.

Cites work

• scientific article; zbMATH DE number 446512 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A heuristic for finding embedded network structure in mathematical programmes
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
• Automatic identification of embedded network rows in large-scale optimization models
• Converting Linear Programs to Network Problems
• Determining GUB sets via an invert agenda algorithm
• Extracting embedded generalized networks from linear programming problems
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• Finding Equivalent Network Formulations for Constrained Network Problems
• Generalized upper bounding techniques
• Identification of special structure constraints in linear programs
• Implicit representation of generalized variable upper bounds in linear programming
• The elimination form of the inverse and its application to linear programming
• The practical conversion of linear programmes to network flow models
• The simplex SON algorithm for LP/embedded network problems
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

Cited in

(10)

• Solving embedded generalized network problems
• Extracting embedded generalized networks from linear programming problems
• Automatic identification of embedded network rows in large-scale optimization models
• 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
• An exact approach to the problem of extracting an embedded network matrix
• scientific article; zbMATH DE number 3858846 (Why is no real title available?)
• scientific article; zbMATH DE number 60242 (Why is no real title available?)
• Extracting pure network submatrices in linear programs using signed graphs.

This page was built for publication: Detecting embedded pure network structures in LP problems

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