Kravtsov Mikhail Konstantinovich

Publications in Math-Net.Ru

1. Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 53:5 (2013),  825–836
2. Types of maximally noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2012, no. 3,  9–16
3. Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 47:6 (2007),  1077–1086
4. Investigation of polynomial algorithms for solving the three-index planar assignment problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 46:2 (2006),  222–228
5. On the noninteger polyhedron vertices of the three-index axial transportation problem
   
   Avtomat. i Telemekh., 2004, no. 3,  71–79
6. A multicriteria approach to optimization of the gross domestic product
   
   Avtomat. i Telemekh., 2004, no. 2,  198–207
7. On types of $(3n-2)$-noninteger vertices of the polytope of a three-index axial choice problem
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2002, no. 12,  84–90
8. On noninteger vertices of the polytope of the three-index axial assignment problem
   
   Diskr. Mat., 13:2 (2001),  120–143
9. Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 41:2 (2001),  342–345
10. A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
    
    Diskr. Mat., 12:1 (2000),  107–112
11. On the number of $r$-fractional vertices of the polyhedron of a tri-index axial choice problem
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 2000, no. 12,  89–92
12. Fractional vertices of the polyhedron of a multi-index axial choice problem
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12,  65–70
13. A polynomial algorithm for the multi-index decision problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 39:6 (1999),  1041–1044
14. Asymptotics of multi-index axial transportation polytopes
    
    Diskr. Mat., 10:4 (1998),  61–81
15. A linear convolution of criteria in bicriterial optimization
    
    Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12,  63–70
16. On the quasistability of trajectory problems of vector optimization
    
    Mat. Zametki, 63:1 (1998),  21–27
17. Asymptotic approach to solving the multi-index axial transportation problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 38:7 (1998),  1133–1139
18. Solvability of the vector problem by the linear criteria convolution algorithm
    
    Mat. Zametki, 62:4 (1997),  502–509
19. Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
    
    Zh. Vychisl. Mat. Mat. Fiz., 37:11 (1997),  1405–1408
20. The unsolvability of vector discrete optimization problems in a class of algorithms of a linear convolution of criteria
    
    Diskr. Mat., 8:2 (1996),  89–96
21. On the number of bases in a transportation problem with exclusions
    
    Diskr. Mat., 7:2 (1995),  3–18
22. Combinatorial problems of vector optimization
    
    Diskr. Mat., 7:1 (1995),  3–18
23. Lexicographic optima in the multicriteria discrete optimization problem
    
    Mat. Zametki, 58:3 (1995),  365–371
24. Conditions for Pareto optimality in a discrete vector problem on a system of subsets
    
    Zh. Vychisl. Mat. Mat. Fiz., 35:11 (1995),  1641–1652
25. On the unsolvability of vector discrete optimization problems on systems of subsets in a class of algorithms of a linear convolution of criteria
    
    Dokl. Akad. Nauk, 334:1 (1994),  9–11
26. Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
    
    Zh. Vychisl. Mat. Mat. Fiz., 34:7 (1994),  1082–1094
27. Transportation polytopes with a minimal number of $k$-faces
    
    Diskr. Mat., 4:3 (1992),  108–117
28. A proof of the Hirsch conjecture for a class of transportation polytopes
    
    Diskr. Mat., 4:2 (1992),  23–31
29. Multi-index planar transportation polytopes with a maximum number of vertices
    
    Diskr. Mat., 4:1 (1992),  3–18
30. Polyhedral aspects of multi-index axial transportation problems
    
    Diskr. Mat., 3:2 (1991),  3–24
31. Polyhedral aspects of multi-index transportation problems with axial sums
    
    Dokl. Akad. Nauk SSSR, 315:6 (1990),  1298–1302
32. Polyhedral aspects of transportation problems
    
    Dokl. Akad. Nauk SSSR, 309:2 (1989),  271–275
33. Transportation polyhedra with a maximum number of $k$-faces
    
    Dokl. Akad. Nauk SSSR, 282:4 (1985),  784–788
34. The diameter and radius of the transportation polyhedron
    
    Dokl. Akad. Nauk SSSR, 270:2 (1983),  278–281
35. On some classes of transportation polytopes
    
    Dokl. Akad. Nauk SSSR, 241:3 (1978),  532–535
36. On some properties of transportation polytopes with maximum number of vertices
    
    Dokl. Akad. Nauk SSSR, 228:5 (1976),  1025–1028


37. Remark on the paper “A polynomial algorithm for the multi-index choice problem”
    
    Zh. Vychisl. Mat. Mat. Fiz., 40:9 (2000),  1440