Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Kravtsov, Mikhail Konstantinovich
Statistics Math-Net.Ru
Total publications: 37
Scientific articles: 36

Number of views:
This page:2064
Abstract pages:10045
Full texts:4339
References:1047
Professor

https://www.mathnet.ru/eng/person19431
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/106375

Publications in Math-Net.Ru Citations
2013
1. V. M. Kravtsov, M. K. Kravtsov, “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  mathnet  mathscinet  elib; Comput. Math. Math. Phys., 53:5 (2013), 655–665  isi  scopus 2
2012
2. M. K. Kravtsov, V. M. Kravtsov, “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  mathnet  mathscinet; Russian Math. (Iz. VUZ), 56:3 (2012), 6–13  scopus 2
2007
3. S. A. Dichkovskaya, M. K. Kravtsov, “Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem”, Zh. Vychisl. Mat. Mat. Fiz., 47:6 (2007),  1077–1086  mathnet  elib; Comput. Math. Math. Phys., 47:6 (2007), 1029–1038  scopus 3
2006
4. S. A. Dichkovskaya, M. K. Kravtsov, “Investigation of polynomial algorithms for solving the three-index planar assignment problem”, Zh. Vychisl. Mat. Mat. Fiz., 46:2 (2006),  222–228  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 46:2 (2006), 212–217  scopus 5
2004
5. M. K. Kravtsov, E. V. Lukshin, “On the noninteger polyhedron vertices of the three-index axial transportation problem”, Avtomat. i Telemekh., 2004, no. 3,  71–79  mathnet  mathscinet  zmath; Autom. Remote Control, 65:3 (2004), 422–430  isi  scopus 5
6. M. K. Kravtsov, A. V. Pashkevich, “A multicriteria approach to optimization of the gross domestic product”, Avtomat. i Telemekh., 2004, no. 2,  198–207  mathnet  mathscinet  zmath; Autom. Remote Control, 65:2 (2004), 337–345  isi  scopus 9
2002
7. V. M. Kravtsov, M. K. Kravtsov, E. V. Lukshin, “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  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 46:12 (2002), 82–88 8
2001
8. M. K. Kravtsov, V. M. Kravtsov, E. V. Lukshin, “On noninteger vertices of the polytope of the three-index axial assignment problem”, Diskr. Mat., 13:2 (2001),  120–143  mathnet  mathscinet  zmath; Discrete Math. Appl., 11:3 (2001), 303–323 11
9. M. K. Kravtsov, A. P. Krachkovskii, “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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 41:2 (2001), 318–321 4
2000
10. M. K. Kravtsov, “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  mathnet  mathscinet  zmath; Discrete Math. Appl., 10:1 (2000), 109–114 2
11. M. K. Kravtsov, V. M. Kravtsov, E. V. Lukshin, “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  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 44:12 (2000), 87–90 4
1999
12. M. K. Kravtsov, E. V. Lukshin, “Fractional vertices of the polyhedron of a multi-index axial choice problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12,  65–70  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 43:12 (1999), 61–66 6
13. M. K. Kravtsov, A. P. Krachkovskii, “A polynomial algorithm for the multi-index decision problem”, Zh. Vychisl. Mat. Mat. Fiz., 39:6 (1999),  1041–1044  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 39:6 (1999), 1002–1005 3
1998
14. M. K. Kravtsov, A. P. Krachkovskii, “Asymptotics of multi-index axial transportation polytopes”, Diskr. Mat., 10:4 (1998),  61–81  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:6 (1998), 589–610 4
15. M. K. Kravtsov, O. A. Yanushkevich, “A linear convolution of criteria in bicriterial optimization”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12,  63–70  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 42:12 (1998), 60–66
16. V. A. Emelichev, M. K. Kravtsov, D. P. Podkopaev, “On the quasistability of trajectory problems of vector optimization”, Mat. Zametki, 63:1 (1998),  21–27  mathnet  mathscinet  zmath; Math. Notes, 63:1 (1998), 19–24  isi 19
17. M. K. Kravtsov, A. P. Krachkovskii, “Asymptotic approach to solving the multi-index axial transportation problem”, Zh. Vychisl. Mat. Mat. Fiz., 38:7 (1998),  1133–1139  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 38:7 (1998), 1083–1089 4
1997
18. M. K. Kravtsov, O. A. Yanushkevich, “Solvability of the vector problem by the linear criteria convolution algorithm”, Mat. Zametki, 62:4 (1997),  502–509  mathnet  mathscinet  zmath; Math. Notes, 62:4 (1997), 420–425  isi 2
19. V. A. Emelichev, M. K. Kravtsov, O. A. Yanushkevich, “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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 37:11 (1997), 1362–1365 1
1996
20. M. K. Kravtsov, “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  mathnet  mathscinet  zmath; Discrete Math. Appl., 6:3 (1996), 225–232 5
1995
21. M. K. Kravtsov, A. A. Gladkii, “On the number of bases in a transportation problem with exclusions”, Diskr. Mat., 7:2 (1995),  3–18  mathnet  mathscinet  zmath; Discrete Math. Appl., 5:3 (1995), 187–201
22. V. A. Emelichev, M. K. Kravtsov, “Combinatorial problems of vector optimization”, Diskr. Mat., 7:1 (1995),  3–18  mathnet  mathscinet  zmath; Discrete Math. Appl., 5:2 (1995), 93–106 4
23. V. A. Emelichev, M. K. Kravtsov, “Lexicographic optima in the multicriteria discrete optimization problem”, Mat. Zametki, 58:3 (1995),  365–371  mathnet  mathscinet  zmath; Math. Notes, 58:3 (1995), 928–932  isi 3
24. V. A. Emelichev, M. K. Kravtsov, O. A. Yanushkevich, “Conditions for Pareto optimality in a discrete vector problem on a system of subsets”, Zh. Vychisl. Mat. Mat. Fiz., 35:11 (1995),  1641–1652  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 35:11 (1995), 1321–1329  isi 2
1994
25. V. A. Emelichev, M. K. Kravtsov, “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  mathnet  mathscinet  zmath; Dokl. Math., 49:1 (1994), 6–9 8
26. V. A. Emelichev, M. K. Kravtsov, “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  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 34:7 (1994), 933–942  isi 7
1992
27. M. K. Kravtsov, “Transportation polytopes with a minimal number of $k$-faces”, Diskr. Mat., 4:3 (1992),  108–117  mathnet  mathscinet  zmath; Discrete Math. Appl., 3:2 (1993), 115–125 3
28. M. K. Kravtsov, “A proof of the Hirsch conjecture for a class of transportation polytopes”, Diskr. Mat., 4:2 (1992),  23–31  mathnet  mathscinet  zmath; Discrete Math. Appl., 3:1 (1993), 41–50
29. V. A. Emelichev, M. K. Kravtsov, A. P. Krachkovskii, “Multi-index planar transportation polytopes with a maximum number of vertices”, Diskr. Mat., 4:1 (1992),  3–18  mathnet  mathscinet  zmath; Discrete Math. Appl., 2:6 (1992), 571–586 3
1991
30. V. A. Emelichev, M. K. Kravtsov, “Polyhedral aspects of multi-index axial transportation problems”, Diskr. Mat., 3:2 (1991),  3–24  mathnet  mathscinet  zmath; Discrete Math. Appl., 2:4 (1992), 357–379 13
1990
31. M. K. Kravtsov, “Polyhedral aspects of multi-index transportation problems with axial sums”, Dokl. Akad. Nauk SSSR, 315:6 (1990),  1298–1302  mathnet  mathscinet  zmath; Dokl. Math., 42:3 (1991), 890–894 4
1989
32. M. K. Kravtsov, “Polyhedral aspects of transportation problems”, Dokl. Akad. Nauk SSSR, 309:2 (1989),  271–275  mathnet  mathscinet  zmath; Dokl. Math., 40:3 (1990), 500–505 3
1985
33. A. P. Krachkovskii, M. K. Kravtsov, V. A. Emelichev, “Transportation polyhedra with a maximum number of $k$-faces”, Dokl. Akad. Nauk SSSR, 282:4 (1985),  784–788  mathnet  mathscinet  zmath
1983
34. M. K. Kravtsov, “The diameter and radius of the transportation polyhedron”, Dokl. Akad. Nauk SSSR, 270:2 (1983),  278–281  mathnet  mathscinet  zmath 2
1978
35. V. A. Emelichev, M. K. Kravtsov, A. P. Krachkovskii, “On some classes of transportation polytopes”, Dokl. Akad. Nauk SSSR, 241:3 (1978),  532–535  mathnet  mathscinet  zmath
1976
36. V. A. Emelichev, M. K. Kravtsov, “On some properties of transportation polytopes with maximum number of vertices”, Dokl. Akad. Nauk SSSR, 228:5 (1976),  1025–1028  mathnet  mathscinet  zmath 1
2000
37. M. K. Kravtsov, A. P. Krachkovskii, “Remark on the paper “A polynomial algorithm for the multi-index choice problem””, Zh. Vychisl. Mat. Mat. Fiz., 40:9 (2000),  1440  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 40:9 (2000), 1381 3

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024