Detecting embedded pure network structures in LP problems
type: Item
instance of: scholarly article
title: Detecting embedded pure network structures in LP problems
zbMATH Open document ID: 0909.90210
DOI: 10.1007/BF02564799
author: Gautam Mitra
author: Nalân Gülpinar
author: István Maros
published in: Top
publication date: 1998-10-27T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 1203198
zbMATH Keywords: linear programming
zbMATH Keywords: embedded network
zbMATH Keywords: network optimization
zbMATH Keywords: network structures
zbMATH Keywords: embedded pure network
zbMATH Keywords: GUB based algorithm
Wikidata QID: Q74601194
MaRDI profile type: Publication
cites work: A heuristic for finding embedded network structure in mathematical programmes
cites work: The practical conversion of linear programmes to network flow models
cites work: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
cites work: Converting Linear Programs to Network Problems
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Automatic identification of embedded network rows in large-scale optimization models
cites work: Extracting embedded generalized networks from linear programming problems
cites work: Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
cites work: Generalized upper bounding techniques
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: Q3740904
cites work: The simplex SON algorithm for LP/embedded network problems
cites work: Determining GUB sets via an invert agenda algorithm
cites work: Identification of special structure constraints in linear programs
cites work: Q3968758
cites work: Finding Equivalent Network Formulations for Constrained Network Problems
cites work: The elimination form of the inverse and its application to linear programming
cites work: Q3142436
cites work: Implicit representation of generalized variable upper bounds in linear programming
cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
full work available at URL: https://doi.org/10.1007/bf02564799
OpenAlex ID: W2075313924
description: scientific article; zbMATH DE number 1203198