Converting Linear Programs to Network Problems
From MaRDI portal
Publication:3885552
DOI10.1287/moor.5.3.321zbMath0442.90095OpenAlexW2011043621WikidataQ56430157 ScholiaQ56430157MaRDI QIDQ3885552
William H. Cunningham, Robert E. Bixby
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.3.321
algorithmnetwork flow problembinary matroidlinear programsgraphic matroidnetwork problemsequivalent transformationelementary row operationsnonzero variable-scaling
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
The signal flow graph method of goal programming ⋮ On the equivalence of constrained and unconstrained flows ⋮ Even circuits in oriented matroids ⋮ Unnamed Item ⋮ Binary group and Chinese postman polyhedra ⋮ Recognizing binet matrices ⋮ Elementary strong maps of graphic matroids ⋮ Adjoints of binary matroids ⋮ A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem ⋮ Miu Cost Tensions ⋮ The incidence structure of subspaces with well-scaled frames ⋮ Layering strategies for creating exploitable structure in linear and integer programs ⋮ Signed-graphic matroids with all-graphic cocircuits ⋮ Subspaces with well-scaled frames ⋮ Independence and port oracles for matroids, with an application to computational learning theory ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Binary signed-graphic matroids: representations and recognition algorithms ⋮ An efficient PQ-graph algorithm for solving the graph-realization problem ⋮ Implementation of a unimodularity test ⋮ The structure of bases in bicircular matroids ⋮ A survey of dynamic network flows ⋮ Separating cocircuits in binary matroids ⋮ Characterizing graphic matroids by a system of linear equations ⋮ Extracting pure network submatrices in linear programs using signed graphs. ⋮ Recognizing graphic matroids ⋮ Representations of bicircular matroids ⋮ A Characterization of Graphic Matroids Based on Circuit Orderings ⋮ Automatic identification of embedded network rows in large-scale optimization models ⋮ Recognizing hidden bicircular networks ⋮ Local optimality subsets and global optimization: A prospective approach ⋮ On Mighton's characterization of graphic matroids ⋮ Convexity and global optimization: A theoretical link ⋮ Application of He's homotopy perturbation method for Cauchy problem of ill-posed nonlinear diffusion equation ⋮ Determinacy in Linear Systems and Networks ⋮ Recognizing Helly edge-path-tree graphs and their clique graphs ⋮ A heuristic for finding embedded network structure in mathematical programmes ⋮ Detecting embedded pure network structures in LP problems ⋮ Making sparse matrices sparser: Computational results ⋮ The practical conversion of linear programmes to network flow models ⋮ Future paths for integer programming and links to artificial intelligence ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs ⋮ On the efficiency of representability tests for matroids ⋮ A good submatrix is hard to find ⋮ Integrality properties of edge path tree families ⋮ On the representability of totally unimodular matrices on bidirected graphs ⋮ Computational implementation of Fujishige's graph realizability algorithm ⋮ On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties ⋮ Fuzzy multicriteria integer programming via fuzzy generalized networks ⋮ On the complexity of recognizing a class of generalized networks ⋮ Uncovering generalized-network structure in matrices ⋮ A recognition problem in converting linear programming to network flow models ⋮ Nonseparating Cocircuits in Binary Matroids ⋮ Extracting embedded generalized networks from linear programming problems
Uses Software
