Geodesic
On the polynomial complexity of a modified simplex method
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 7, pp. 1244-1260 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2004_44_7_a7,
     author = {V. A. Bereznev},
     title = {On the polynomial complexity of a modified simplex method},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1244--1260},
     year = {2004},
     volume = {44},
     number = {7},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_7_a7/}
}
TY  - JOUR
AU  - V. A. Bereznev
TI  - On the polynomial complexity of a modified simplex method
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2004
SP  - 1244
EP  - 1260
VL  - 44
IS  - 7
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_7_a7/
LA  - ru
ID  - ZVMMF_2004_44_7_a7
ER  - 
%0 Journal Article
%A V. A. Bereznev
%T On the polynomial complexity of a modified simplex method
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2004
%P 1244-1260
%V 44
%N 7
%U http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_7_a7/
%G ru
%F ZVMMF_2004_44_7_a7
V. A. Bereznev. On the polynomial complexity of a modified simplex method. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 7, pp. 1244-1260. http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_7_a7/

[1] Klee V., Minty G. J., How good is simplex algorithm?, Inequalities, v. III, Acad. Press, New York–London, 1972, 159–175 | MR

[2] Khachiyan L. G., “Polinomialnyi algoritm lineinogo programmirovaniya”, Dokl. AN SSSR, 244:5 (1979), 1093–1096 | MR | Zbl

[3] Karmarkar N., “A new polynomial-time algorithm for linear programming”, Combinatorica, 4:4 (1984), 373–395 | DOI | MR | Zbl

[4] Nesterov Yu. E., “Metod lineinogo programmirovaniya s kubicheskoi trudoemkostyu”, Ekonomika i matem. metody, 24:1 (1988), 174–176 | MR | Zbl

[5] Vasilyev F. P., Ivanitskiy A. Yu., In-depth analysis of linear programming, Kluwer Acad. Publ., Dordrecht, 2001

[6] Vasilev F. P., Ivanitskii A. Yu., Lineinoe programmirovanie, Faktorial, M., 2003 | MR

[7] Golshtein E. G., Yudin D. B., Zadachi i metody lineinogo programmirovaniya, Sov. radio, M., 1961

[8] Karmanov V. G., Matematicheskoe programmirovanie, Fizmatgiz, M., 2000 | Zbl

[9] Ashmanov S. A., Lineinoe programmirovanie, Nauka, M., 1981 | Zbl

[10] Golshtein E. G., Yudin D. B., Novye napravleniya v lineinom programmirovanii, Sov. radio, M., 1966 | MR

[11] Bereznev V. A., “Ob odnoi modifikatsii simpleks-metoda”, Vopr. modelirovaniya i analiza v zadachakh prinyatiya reshenii, VTs RAN, M., 2002, 93–120