no. 2
Achievable potential reductions in the method of Kojima et al. in the case of linear programming
RAIRO - Operations Research - Recherche Opérationnelle, Tome 28 (1994) no. 2, pp. 123-133. 
@article{RO_1994__28_2_123_0,
     author = {Roos, C. and Vial, J.-Ph.},
     title = {Achievable potential reductions in the method of {Kojima} et al. in the case of linear programming},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {123--133},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {2},
     year = {1994},
     mrnumber = {1277324},
     zbl = {0860.90087},
     language = {en},
     url = {http://www.numdam.org/item/RO_1994__28_2_123_0/}
}
TY  - JOUR
AU  - Roos, C.
AU  - Vial, J.-Ph.
TI  - Achievable potential reductions in the method of Kojima et al. in the case of linear programming
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1994
SP  - 123
EP  - 133
VL  - 28
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1994__28_2_123_0/
LA  - en
ID  - RO_1994__28_2_123_0
ER  - 
%0 Journal Article
%A Roos, C.
%A Vial, J.-Ph.
%T Achievable potential reductions in the method of Kojima et al. in the case of linear programming
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1994
%P 123-133
%V 28
%N 2
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1994__28_2_123_0/
%G en
%F RO_1994__28_2_123_0
Roos, C.; Vial, J.-Ph. Achievable potential reductions in the method of Kojima et al. in the case of linear programming. RAIRO - Operations Research - Recherche Opérationnelle, Tome 28 (1994) no. 2, pp. 123-133. http://www.numdam.org/item/RO_1994__28_2_123_0/

1. N. Karmarkar, A New Polynomial-Time Algorithm for Linear Programming, Combinatorica, 4, 1984, pp. 373-395. | MR | Zbl

2. M. Kojima, S. Mizuno, A. Yoshise, An O (√nL) Potential Reduction Algorithm for Linear Complementary Problems | Zbl

3. Y. Ye, A Class of Projective Transformations for Linear Programming, SIAM Journal on Computing, 19, 1990, pp. 457-466. | MR