Zobrazeno 1 - 3
of 3
pro vyhledávání: '"George Geranis"'
Autor:
George Geranis, Angelo Sifaleras
Publikováno v:
Electronic Notes in Discrete Mathematics. 41:93-100
Recently, a new Dual Network Exterior-Point Simplex Algorithm (DNEPSA) for the Minimum Cost Network Flow Problem (MCNFP) has been developed. In extensive computational studies, DNEPSA performed better than the classical Dual Network Simplex Algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e574b453f82ab8a1dbb05af87c2c2269
https://doi.org/10.1016/j.endm.2013.05.080
https://doi.org/10.1016/j.endm.2013.05.080
Publikováno v:
RAIRO - Operations Research. 46:211-234
The minimum cost network flow problem, (MCNFP) con- stitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special "exteri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::259d92c9eba57e86c3a373bc1f1958e8
https://doi.org/10.1051/ro/2012015
https://doi.org/10.1051/ro/2012015
Publikováno v:
Yugoslav Journal of Operations Research, Vol 19, Iss 1, Pp 157-170 (2009)
A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category. Similarly to the classical network dual simplex algorithm (NDSA), t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b67aebb6a26b47a889af714e09103b73
http://www.doiserbia.nb.rs/img/doi/0354-0243/2009/0354-02430901157G.pdf
http://www.doiserbia.nb.rs/img/doi/0354-0243/2009/0354-02430901157G.pdf