Detecting embedded pure network structures in LP problems
DOI10.1007/BF02564799zbMath0909.90210OpenAlexW2075313924WikidataQ74601194 ScholiaQ74601194MaRDI QIDQ1265245
Gautam Mitra, István Maros, Nalân Gülpinar
Publication date: 27 October 1998
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02564799
linear programmingnetwork optimizationnetwork structuresembedded networkembedded pure networkGUB based algorithm
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The practical conversion of linear programmes to network flow models
- A heuristic for finding embedded network structure in mathematical programmes
- Generalized upper bounding techniques
- The Elimination form of the Inverse and its Application to Linear Programming
- Automatic identification of embedded network rows in large-scale optimization models
- Extracting embedded generalized networks from linear programming problems
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Converting Linear Programs to Network Problems
- Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
- Identification of special structure constraints in linear programs
- The simplex SON algorithm for LP/embedded network problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Determining GUB sets via an invert agenda algorithm
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Finding Equivalent Network Formulations for Constrained Network Problems
- Implicit representation of generalized variable upper bounds in linear programming
This page was built for publication: Detecting embedded pure network structures in LP problems
