The practical conversion of linear programmes to network flow models

DOI10.1016/0377-2217(91)90264-VzbMath0722.90045MaRDI QIDQ757237

D. Kharzeev

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

spanning treeequivalent problem transformationminimum cost network flow models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

The out‐of‐kilter algorithm for solving network problems ⋮ A heuristic for finding embedded network structure in mathematical programmes ⋮ Detecting embedded pure network structures in LP problems ⋮ The practical conversion of linear programmes to network flow models ⋮ A recognition problem in converting linear programming to network flow models

Cites Work

• Unnamed Item
• Unnamed Item
• The practical conversion of linear programmes to network flow models
• A good submatrix is hard to find
• Automatic identification of embedded network rows in large-scale optimization models
• Optimal Capacity Scheduling—I
• 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
• Determining GUB sets via an invert agenda algorithm
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Testing of a large-scale network optimization program
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Lectures on matroids
• A Control Problem of Bellman

This page was built for publication: The practical conversion of linear programmes to network flow models