Converting Linear Programs to Network Problems
From MaRDI portal
Cited in
(56)- Adjoints of binary matroids
- On the efficiency of representability tests for matroids
- scientific article; zbMATH DE number 1423919 (Why is no real title available?)
- Characterizing graphic matroids by a system of linear equations
- Miu Cost Tensions
- On the representability of totally unimodular matrices on bidirected graphs
- A mathematical programming approach for recognizing binet matrices
- Detecting embedded pure network structures in LP problems
- Determinacy in Linear Systems and Networks
- Extended formulations for the integer hull of strictly -modular cographic polyhedral cones
- Elementary strong maps of graphic matroids
- Separating cocircuits in binary matroids
- A characterization of graphic matroids based on circuit orderings
- Integrality properties of edge path tree families
- Future paths for integer programming and links to artificial intelligence
- Layering strategies for creating exploitable structure in linear and integer programs
- Extracting embedded generalized networks from linear programming problems
- Automatic identification of embedded network rows in large-scale optimization models
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- A heuristic for finding embedded network structure in mathematical programmes
- Subspaces with well-scaled frames
- Computational implementation of Fujishige's graph realizability algorithm
- Uncovering generalized-network structure in matrices
- Application of He's homotopy perturbation method for Cauchy problem of ill-posed nonlinear diffusion equation
- Nonseparating Cocircuits in Binary Matroids
- A good submatrix is hard to find
- Independence and port oracles for matroids, with an application to computational learning theory
- Representations of bicircular matroids
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Fuzzy multicriteria integer programming via fuzzy generalized networks
- Decomposition of quaternary signed-graphic matroids
- Making sparse matrices sparser: Computational results
- The practical conversion of linear programmes to network flow models
- On Mighton's characterization of graphic matroids
- An efficient PQ-graph algorithm for solving the graph-realization problem
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- Even circuits in oriented matroids
- The structure of bases in bicircular matroids
- Recognizing graphic matroids
- A survey of dynamic network flows
- On the equivalence of constrained and unconstrained flows
- On the complexity of recognizing a class of generalized networks
- Binary group and Chinese postman polyhedra
- Binary signed-graphic matroids: representations and recognition algorithms
- Recognizing hidden bicircular networks
- Signed-graphic matroids with all-graphic cocircuits
- Convexity and global optimization: A theoretical link
- The incidence structure of subspaces with well-scaled frames
- Extracting pure network submatrices in linear programs using signed graphs.
- Recognizing binet matrices
- Implementation of a unimodularity test
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- A recognition problem in converting linear programming to network flow models
- The signal flow graph method of goal programming
- Local optimality subsets and global optimization: A prospective approach
- On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
This page was built for publication: Converting Linear Programs to Network Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885552)
