Geodesic
A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
Yugoslav journal of operations research, Tome 19 (2009) no. 1, p. 157

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

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), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration. However, contrary to the NDSA, the new algorithm does not always maintain a dual feasible solution. Instead, the new algorithm might reach a basic point (tree-solution) outside the dual feasible area (exterior point - dual infeasible tree).
Classification : 90C35 90C27 90C05
Keywords: Operations research, combinatorial optimization, minimum cost network flow problem. 
@article{YJOR_2009_19_1_a11,
     author = {George Geranis and Konstantinos Paparrizos and Angelo Sifaleras},
     title = {A {Dual} {Exterior} {Point} {Simplex} {Type} {Algorithm} for the {Minimum} {Cost} {Network} {Flow} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {157 },
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2009},
     zbl = {1274.90457},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a11/}
}
TY  - JOUR
AU  - George Geranis
AU  - Konstantinos Paparrizos
AU  - Angelo Sifaleras
TI  - A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
JO  - Yugoslav journal of operations research
PY  - 2009
SP  - 157 
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a11/
LA  - en
ID  - YJOR_2009_19_1_a11
ER  - 
%0 Journal Article
%A George Geranis
%A Konstantinos Paparrizos
%A Angelo Sifaleras
%T A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
%J Yugoslav journal of operations research
%D 2009
%P 157 
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a11/
%G en
%F YJOR_2009_19_1_a11
George Geranis; Konstantinos Paparrizos; Angelo Sifaleras. A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem. Yugoslav journal of operations research, Tome 19 (2009) no. 1, p. 157 . http://geodesic.mathdoc.fr/item/YJOR_2009_19_1_a11/