The practical conversion of linear programmes to network flow models
Baston, V. J. D., Rahmouni, M. K. & Williams, H. P.
(1991).
The practical conversion of linear programmes to network flow models.
European Journal of Operational Research,
50(3), 325-334.
https://doi.org/10.1016/0377-2217(91)90264-V
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.
| Item Type | Article |
|---|---|
| Copyright holders | © 1991 Elsevier B.V. |
| Departments | LSE > Academic Departments > Management |
| DOI | 10.1016/0377-2217(91)90264-V |
| Date Deposited | 23 Jan 2011 |
| URI | https://researchonline.lse.ac.uk/id/eprint/31575 |
Explore Further
- https://www.scopus.com/pages/publications/0026105207 (Scopus publication)
- http://www.elsevier.com/locate/ejor (Official URL)