A dual exterior point simplex type algorithm for the minimum cost network flow problem

  • G. Geranis
Published
Oct 11, 2016
How to Cite
GERANIS, G.. A dual exterior point simplex type algorithm for the minimum cost network flow problem. Yugoslav Journal of Operations Research, [S.l.], v. 19, n. 1, oct. 2016. ISSN 2334-6043. Available at: <http://yujor.fon.bg.ac.rs/index.php/yujor/article/view/319>. Date accessed: 28 apr. 2024.
Citation Formats
Issue
Vol 19 No 1 (2009): Vol. 19 No. 1
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.