A recognition problem in converting linear programming to network flow models

DOI10.1007/BF02661994zbMath0782.90034MaRDI QIDQ1309143

Yanpei Liu

Publication date: 28 February 1994

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

zbMATH Keywords

treesequencinginduced subgraphpolygon-matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (6)

Time variant multi-objective linear fractional interval-valued transportation problem ⋮ Cycle-based reducibility of multi-index transport-type systems of linear inequalities ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Three-index linear programs with nested structure ⋮ Multi-index transportation problems with 1-nested structure ⋮ Multi-index transport problems with decomposition structure

Cites Work

• The practical conversion of linear programmes to network flow models
• Packing Problems and Hypergraph Theory: A Survey
• Converting Linear Programs to Network Problems
• Testing of a large-scale network optimization program
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A recognition problem in converting linear programming to network flow models