Khachiyan Leonid Genrikhovich

Publications in Math-Net.Ru

1. The problem of calculating the volume of a polyhedron is enumerably hard
   
   Uspekhi Mat. Nauk, 44:3(267) (1989),  179–180
2. The method of inscribed ellipsoids
   
   Dokl. Akad. Nauk SSSR, 298:5 (1988),  1081–1085
3. Cyclic games and an algorithm to find minimax cycle means in directed graphs
   
   Zh. Vychisl. Mat. Mat. Fiz., 28:9 (1988),  1407–1417
4. A certain inequality for convex forms
   
   Mat. Zametki, 41:4 (1987),  521–524
5. On the exact solution of systems of linear inequalities and linear programming problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 22:4 (1982),  999–1002
6. Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities
   
   Dokl. Akad. Nauk SSSR, 255:2 (1980),  296–300
7. The polynomial solvability of convex quadratic programming
   
   Zh. Vychisl. Mat. Mat. Fiz., 20:5 (1980),  1319–1323
8. Polynomial algorithms in linear programming
   
   Zh. Vychisl. Mat. Mat. Fiz., 20:1 (1980),  51–68
9. Polynomial solvability of convex quadratic programming
   
   Dokl. Akad. Nauk SSSR, 248:5 (1979),  1049–1051
10. A polynomial algorithm in linear programming
    
    Dokl. Akad. Nauk SSSR, 244:5 (1979),  1093–1096
11. Convergence rate of the game processes for solving matrix games
    
    Zh. Vychisl. Mat. Mat. Fiz., 17:6 (1977),  1421–1431