Skip to main content
Article thumbnail
Location of Repository

The practical conversion of linear programmes to network flow models

By V. J. D. Baston, M. K. Rahmouni and H. Paul Williams


A practical algorithm for converting Linear (and Integer) Programs to Minimum Cost Network Flow Models is described. Reasons for the importance of such conversions are given. The method depends on the representation of a network by one of its Polygon Matrices. In this representation, which is described, polygons (circuits) of a network are given in terms of a spanning tree

Topics: QA Mathematics
Publisher: Elsevier
Year: 1991
DOI identifier: 10.1016/0377-2217(91)90264-V
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.