| Article ID: | iaor1993730 |
| Country: | Netherlands |
| Volume: | 50 |
| Issue: | 3 |
| Start Page Number: | 325 |
| End Page Number: | 334 |
| Publication Date: | Feb 1991 |
| Journal: | European Journal of Operational Research |
| Authors: | Williams H.P., Baston V.J.D., Rahmouni M.K. |
| Keywords: | programming: network |
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.