Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Emelichev, Vladimir Alekseevich

Statistics Math-Net.Ru
Total publications: 109
Scientific articles: 106

Number of views:
This page:4527
Abstract pages:30933
Full texts:9958
References:2813
Professor
Doctor of physico-mathematical sciences
E-mail: , ,

http://www.mathnet.ru/eng/person18499
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/63295
https://elibrary.ru/author_items.asp?authorid=519056

Publications in Math-Net.Ru
2020
1. Vladimir A. Emelichev, Sergey E. Bukhtoyarov, “On two stability types for a multicriteria integer linear programming problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2020, 1,  17–30  mathnet
2019
2. S. E. Bukhtoyarov, V. A. Emelichev, “Stability aspects of multicriteria integer linear programming problems”, Diskretn. Anal. Issled. Oper., 26:1 (2019),  5–19  mathnet; J. Appl. Industr. Math., 13:1 (2019), 22–29  scopus
3. V. A. Emelichev, S. E. Bukhtoyarov, “Investment Boolean problem with Savage risk criteria under uncertainty”, Diskr. Mat., 31:2 (2019),  20–33  mathnet  mathscinet  elib; Discrete Math. Appl., 30:3 (2020), 159–168  isi  scopus
2018
4. Vladimir A. Emelichev, Yury V. Nikulin, “Aspects of stability for multicriteria quadratic problems of Boolean programming”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2018, 2,  30–40  mathnet
5. V. A. Emelichev, Yu. V. Nikulin, “On some type of stability for multicriteria integer linear programming problem of finding extremum solutions”, Taurida Journal of Computer Science Theory and Mathematics, 2018, 2,  17–28  mathnet
2017
6. V. A. Emelichev, Y. V. Nikulin, “Stability measures for multicriteria quadratic Boolean programming problem of finding extremum solutions”, Tr. Inst. Mat., 25:2 (2017),  82–90  mathnet
7. V. A. Emelichev, S. E. Bukhtoyarov, “On radius of one stability type for a multicriteria investment problem with risk minimization”, Tr. Inst. Mat., 25:1 (2017),  3–14  mathnet
2016
8. Vladimir Emelichev, Sergey Bukhtoyarov, Vadzim Mychkov, “An investment problem under multicriteriality, uncertainty and risk”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2016, 3,  82–98  mathnet
9. V. A. Emelichev, V. I. Mychkov, “Postoptimal analysis for one vector venturesome investment problem”, Tr. Inst. Mat., 24:1 (2016),  9–18  mathnet
2015
10. Vladimir A. Emelichev, Kirill G. Kuzmin, Vadim I. Mychkov, “Estimates of stability radius of multicriteria Boolean problem with Hölder metrics in parameter spaces”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, 2,  74–81  mathnet
11. Vladimir Emelichev, Olga Karelkina, “Stability radius bounds in multicriteria Markowitz portfolio problem with venturesome investor criteria”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, 1,  13–19  mathnet
12. S. E. Bukhtoyarov, V. A. Emelichev, “On stability of solutions of a vector variant of one investment problem”, Diskretn. Anal. Issled. Oper., 22:2 (2015),  5–16  mathnet  mathscinet  elib; J. Appl. Industr. Math., 9:3 (2015), 328–334
2014
13. Vladimir Emelichev, Vladimir Korotkov, “On stability of multicriteria investment Boolean problem with Wald's efficiency criteria”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2014, 1,  3–13  mathnet
14. V. A. Emelichev, E. V. Ustilko, “Postoptimal analysis of multicriteria investment problem with the extreme optimism criteria”, Prikl. Diskr. Mat., 2014, 3(25),  117–123  mathnet
2013
15. V. A. Emelichev, K. G. Kuzmin, “Stability analysis of the efficient solution to a vector problem of a maximum cut”, Diskretn. Anal. Issled. Oper., 20:4 (2013),  27–35  mathnet  mathscinet
16. V. A. Emelichev, K. G. Kuz'min, “Estimating the stability radius of the vector MAX-CUT problem”, Diskr. Mat., 25:2 (2013),  5–12  mathnet  mathscinet  elib; Discrete Math. Appl., 23:2 (2013), 145–152  scopus
17. V. A. Emelichev, R. P. Shatsov, “Markowitz investment Boolean problem in case of uncertainty, multicriteria and risk”, Prikl. Diskr. Mat., 2013, 2(20),  115–122  mathnet
18. V. A. Emelichev, K. G. Kuz'min, “Stability conditions for a multicriteria Boolean problem of minimizing projections of linear functions”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  125–133  mathnet  mathscinet  elib
2012
19. Vladimir Emelichev, Vladimir Korotkov, “Stability analysis of Pareto optimal portfolio of multicriteria investment maximin problem in the Hölder metric”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2012, 3,  63–71  mathnet  mathscinet  zmath
20. Vladimir Emelichev, Vladimir Korotkov, “Post-optimal analysis of investment problem with Wald's ordered maximin criteria”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2012, 1,  59–69  mathnet  mathscinet  zmath
21. V. A. Emelichev, V. V. Korotkov, “Stability analysis of Pareto optimal portfolio of multicriteria investment problem with Wald's maximin criteria”, Diskretn. Anal. Issled. Oper., 19:6 (2012),  23–36  mathnet  mathscinet
22. V. A. Emelichev, V. V. Korotkov, “On stability of a vector Boolean investment problem with Wald's criteria”, Diskr. Mat., 24:3 (2012),  3–16  mathnet  mathscinet  elib; Discrete Math. Appl., 22:4 (2012), 367–381  elib  scopus
23. V. A. Emelichev, V. V. Korotkov, “Investigation of the solution stability of vector investment Boolean problem in the case of Hölder metric in a criteria space”, Prikl. Diskr. Mat., 2012, 4(18),  61–72  mathnet
24. V. A. Emelichev, V. V. Korotkov, “On type of stability of vector investment problem with Wald's criteria”, Tr. Inst. Mat., 20:2 (2012),  10–17  mathnet
25. V. A. Emelichev, V. V. Korotkov, “Stability of lexicographical investment problem with Wald's maximin criteria”, Tr. Inst. Mat., 20:1 (2012),  33–41  mathnet
2011
26. Vladimir Emelichev, Vladimir Korotkov, “On stability radius of the multicriteria variant of Markowitz's investment portfolio problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2011, 1,  83–94  mathnet  mathscinet  zmath
27. V. A. Emelichev, V. V. Korotkov, “On stability radius of effective solution of vector quadratic boolean bottleneck problem”, Diskretn. Anal. Issled. Oper., 18:6 (2011),  3–16  mathnet  mathscinet  zmath
28. V. A. Emelichev, V. V. Korotkov, “Stability radius bounds for the lexicographic optimum of the vector Boolean problem with Savage's risk criteria”, Diskretn. Anal. Issled. Oper., 18:2 (2011),  41–50  mathnet  mathscinet  zmath
29. V. A. Emelichev, V. V. Korotkov, “On the stability radius of an efficient solution of a multicriteria portfolio optimisation problem with the Savage criteria”, Diskr. Mat., 23:4 (2011),  33–38  mathnet  mathscinet  elib; Discrete Math. Appl., 21:5-6 (2011), 509–515
30. V. A. Emelichev, V. V. Korotkov, “On stability of lexicographical solution of vector minimax quadratic Boolean problem”, Tr. Inst. Mat., 19:2 (2011),  26–36  mathnet
2010
31. Vladimir Emelichev, Vladimir Korotkov, Kirill Kuzmin, “On stability of Pareto-optimal solution of portfolio optimization problem with Savage's minimax risk criteria”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2010, 3,  35–44  mathnet  mathscinet  zmath
32. V. A. Emelichev, A. V. Karpuk, K. G. Kuzmin, “On quasistability of the lexicographic minimax combinatorial problem with decomposing variables”, Diskretn. Anal. Issled. Oper., 17:3 (2010),  32–45  mathnet  mathscinet  zmath
33. V. A. Emelichev, A. V. Karpuk, K. G. Kuz'min, “On a measure of quasistability of a certain vector linearly combinatorial Boolean problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, 5,  8–17  mathnet  mathscinet; Russian Math. (Iz. VUZ), 54:5 (2010), 6–14  scopus
34. V. A. Emelichev, V. V. Korotkov, “On stability of efficient solution of vector investment Boolean problemwith Savage's minimax criteria”, Tr. Inst. Mat., 18:2 (2010),  3–10  mathnet  zmath
2009
35. Vladimir Emelichev, Eberhard Girlich, Olga Karelkina, “Postoptimal analysis of multicriteria combinatorial center location problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2009, 3,  13–29  mathnet  mathscinet  zmath
36. Vladimir A. Emelichev, Evgeny E. Gurevsky, Andrey A. Platonov, “On stability and quasi-stability radii for a vector combinatorial problem with a parametric optimality principle”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2009, 2,  55–61  mathnet  mathscinet  zmath
37. V. A. Emelichev, O. V. Karelkina, “On quasistability of a lexicographic MINSUM arrangement problem”, Diskretn. Anal. Issled. Oper., 16:2 (2009),  74–84  mathnet  mathscinet  zmath
38. E. E. Gurevskii, V. A. Emelichev, “On five types of stability of the lexicographic variant of the combinatorial bottleneck problem”, Diskr. Mat., 21:3 (2009),  3–13  mathnet  mathscinet  elib; Discrete Math. Appl., 19:4 (2009), 337–348  scopus
39. V. A. Emelichev, O. V. Karelkina, “Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric”, Diskr. Mat., 21:2 (2009),  43–50  mathnet  mathscinet  elib; Discrete Math. Appl., 19:3 (2009), 229–236  scopus
2008
40. Vladimir A. Emelichev, Andrey A. Platonov, “Measure of quasistability of a vector integer linear programming problem with generalized principle of optimality in the Helder metric”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2008, 2,  58–67  mathnet  mathscinet  zmath
41. V. A. Emelichev, E. Gurevsky, “On stability kernel of a multicriteria combinatorial minimax problem”, Diskretn. Anal. Issled. Oper., 15:5 (2008),  6–19  mathnet  mathscinet  zmath
42. V. A. Emelichev, K. G. Kuz'min, “On stability of a vector combinatorial problem with MINMIN criteria”, Diskr. Mat., 20:4 (2008),  3–7  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 18:6 (2008), 557–562  scopus
43. E. E. Gurevsky, V. A. Emelichev, “Postoptimal analysis of vector partition problem with ordered criteria”, Tr. Inst. Mat., 16:2 (2008),  14–22  mathnet  zmath
2007
44. Vladimir A. Emelichev, Evgeny E. Gurevsky, “Linear convolution of criteria in the vector $p$-center problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2007, 1,  73–82  mathnet  mathscinet  zmath
45. A. G. Vodennikov, V. A. Emelichev, K. G. Kuz'min, “Об одном типе устойчивости векторной комбинаторной задачи размещения”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:2 (2007),  32–40  mathnet  zmath
46. E. Gurevsky, V. A. Emelichev, “Анализ устойчивости лексикографической булевой задачи минимизации модулей линейных функций”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  59–71  mathnet  mathscinet  zmath
47. V. A. Emelichev, K. G. Kuz'min, “A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem”, Diskr. Mat., 19:3 (2007),  79–83  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 17:4 (2007), 349–354  scopus
48. E. Gurevsky, V. A. Emelichev, “On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions”, Diskr. Mat., 19:2 (2007),  45–50  mathnet  mathscinet  zmath  elib; Discrete Math. Appl., 17:3 (2007), 231–236  scopus
49. E. Gurevsky, V. A. Emelichev, A. A. Platonov, “On stability for a finite cooperative game with a generalized concept of equilibrium”, Tr. Inst. Mat., 15:1 (2007),  47–55  mathnet
2006
50. V. A. Emelichev, E. E. Gurevsky, A. A. Platonov, “Measure of stability for a finite cooperative game with a generalized concept of equilibrium”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006, 3,  17–26  mathnet  mathscinet  zmath
51. Vladimir A. Emelichev, Olga V. Karelkina, Kirill G. Kuzmin, “Measure of stability and quasistability to a vector integer programming problem in the $l_1$ metric”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006, 1,  39–50  mathnet  mathscinet  zmath
52. E. Gurevsky, V. A. Emelichev, “On the stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero”, Izv. Vyssh. Uchebn. Zaved. Mat., 2006, 12,  27–32  mathnet  mathscinet; Russian Math. (Iz. VUZ), 50:11 (2006), 24–29
53. S. E. Bukhtoyarov, V. A. Emelichev, “Measure of stability for a finite cooperative game with a parametric optimality principle (from Pareto to Nash)”, Zh. Vychisl. Mat. Mat. Fiz., 46:7 (2006),  1258–1264  mathnet  mathscinet; Comput. Math. Math. Phys., 46:7 (2006), 1193–1199  scopus
2005
54. V. A. Emelichev, K. G. Kuz'min, “Analysis of the sensitivity of an efficient solution of a vector Boolean problem of the minimization of projections of linear functions onto $\mathbb R_+$ and $\mathbb R_-$”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005),  24–43  mathnet  mathscinet  zmath
55. V. A. Emelichev, K. G. Kuz'min, “Measure of quasistability in the metric $l_1$ of a vector combinatorial problem with a parametric optimality principle”, Izv. Vyssh. Uchebn. Zaved. Mat., 2005, 12,  3–10  mathnet  mathscinet; Russian Math. (Iz. VUZ), 49:12 (2005), 1–8
2004
56. V. A. Emelichev, K. G. Kuz'min, A. M. Leonovich, “Stability in the combinatorial vector optimization problems”, Avtomat. i Telemekh., 2004, 2,  79–92  mathnet  mathscinet  zmath; Autom. Remote Control, 65:2 (2004), 227–240  isi  scopus
57. V. A. Emelichev, K. G. Kuz'min, “Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric $l_1$”, Diskr. Mat., 16:4 (2004),  14–19  mathnet  mathscinet  zmath; Discrete Math. Appl., 14:5 (2004), 521–526
58. V. A. Emelichev, V. N. Krichko, “A formula for the stability radius of a vector $l_\infty$-extremal trajectory problem”, Diskr. Mat., 16:1 (2004),  14–20  mathnet  mathscinet  zmath; Discrete Math. Appl., 14:1 (2004), 33–39
59. V. A. Emelichev, K. G. Kuz'min, A. M. Leonovich, “On a type of stability for a vector combinatorial problem with partial criteria of the form $\Sigma$-MINMAX and $\Sigma$-MINMIN”, Izv. Vyssh. Uchebn. Zaved. Mat., 2004, 12,  17–27  mathnet  mathscinet; Russian Math. (Iz. VUZ), 48:12 (2004), 15–25
60. S. E. Bukhtoyarov, V. A. Emelichev, “On the quasistability of a vector trajectory problem with a parametric optimality principle”, Izv. Vyssh. Uchebn. Zaved. Mat., 2004, 1,  25–30  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 48:1 (2004), 23–27
2003
61. S. E. Bukhtoyarov, V. A. Emelichev, “Parametrization of the optimality principle (“from Pareto to Slater”) and the stability of multicriterial trajectory problems”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003),  3–18  mathnet  mathscinet
2002
62. V. A. Emelichev, A. V. Pashkevich, “On the parametrization of the optimality principle in a criterion space”, Diskretn. Anal. Issled. Oper., Ser. 2, 9:1 (2002),  21–32  mathnet  mathscinet
63. V. A. Emelichev, A. V. Pashkevich, “On conditions for the efficiency of a solution of a multicriterial discrete problem”, Diskr. Mat., 14:1 (2002),  17–29  mathnet  mathscinet  zmath; Discrete Math. Appl., 12:2 (2002), 141–153
64. V. A. Emelichev, Yu. v. Stepanishina, “Quasistability of a Vector Trajectory Majority Optimization Problem”, Mat. Zametki, 72:1 (2002),  38–47  mathnet  mathscinet  zmath; Math. Notes, 72:1 (2002), 34–42  isi  scopus
2001
65. V. A. Emelichev, D. P. Podkopaev, “Stability and regularization of vector problems of integer linear programming”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:1 (2001),  47–69  mathnet  mathscinet  zmath
66. V. A. Emelichev, Yu. v. Stepanishina, “Multicriteria combinatorial linear problems: parametrisation of the optimality principle and the stability of the effective solutions”, Diskr. Mat., 13:4 (2001),  43–51  mathnet  mathscinet  zmath; Discrete Math. Appl., 11:5 (2001), 435–444
67. V. A. Emelichev, V. N. Krichko, “Stability radius of an efficient solution to a vector quadratic problem of Boolean programming”, Zh. Vychisl. Mat. Mat. Fiz., 41:2 (2001),  346–350  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 41:2 (2001), 322–326
2000
68. V. A. Emelichev, A. V. Pashkevich, “On a linear convolution of criteria in vector discrete optimization”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000),  12–21  mathnet  mathscinet  zmath
69. V. A. Emelichev, V. G. Pokhil'ko, “Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations”, Diskr. Mat., 12:3 (2000),  37–48  mathnet  mathscinet  zmath; Discrete Math. Appl., 10:4 (2000), 367–378
70. V. A. Emelichev, V. N. Krichko, D. P. Podkopaev, “On the stability radius of a vector problem of linear Boolean programming”, Diskr. Mat., 12:2 (2000),  25–30  mathnet  mathscinet  zmath; Discrete Math. Appl., 10:1 (2000), 103–108
71. V. A. Emelichev, Yu. v. Stepanishina, “Quasistability of a vector nonlinear trajectory problem with the Pareto optimality principle”, Izv. Vyssh. Uchebn. Zaved. Mat., 2000, 12,  27–32  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 44:12 (2000), 25–30
1999
72. V. A. Emelichev, Yu. V. Nikulin, “On two types of stability in a vector linear-quadratic Boolean programming problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 6:2 (1999),  23–31  mathnet  mathscinet  zmath
73. V. A. Emelichev, V. N. Krichko, “On the stability of the Pareto optimum of a vector Boolean programming problem”, Diskr. Mat., 11:4 (1999),  27–32  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:6 (1999), 607–613
74. V. A. Emelichev, A. V. Pashkevich, O. A. Yanushkevich, “Conditions for the efficiency of a solution of a vector discrete optimization problem”, Diskr. Mat., 11:1 (1999),  140–145  mathnet  mathscinet  zmath; Discrete Math. Appl., 9:2 (1999), 155–160
75. V. A. Emelichev, O. A. Yanushkevich, “Regularization of a multicriterial integer linear programming problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1999, 12,  38–42  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 43:12 (1999), 35–39
1998
76. V. A. Emelichev, O. A. Yanushkevich, “On problems of lexicographic optimization”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998),  30–37  mathnet  mathscinet  zmath
77. V. A. Emelichev, R. A. Berdysheva, “On the strong stability of a vector trajectory problem of lexicographic optimization”, Diskr. Mat., 10:3 (1998),  3–9  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:4 (1998), 383–389
78. V. A. Emelichev, R. A. Berdysheva, “On the radii of stability, quasistability and steadiness of a vector trajectory problem of lexicographic optimization”, Diskr. Mat., 10:1 (1998),  20–27  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:2 (1998), 135–142
79. R. A. Berdysheva, V. A. Emelichev, “Some forms of stability of a combinatorial problem of lexicographic optimization”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, 12,  11–21  mathnet  mathscinet  zmath; Russian Math. (Iz. VUZ), 42:12 (1998), 9–19
80. 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
81. V. A. Emelichev, D. P. Podkopaev, “On a quantitative measure of stability for a vector problem in integer programming”, Zh. Vychisl. Mat. Mat. Fiz., 38:11 (1998),  1801–1805  mathnet  mathscinet  zmath; Comput. Math. Math. Phys., 38:11 (1998), 1727–1731
1997
82. V. A. Emelichev, E. Girlikh, O. A. Yanushkevich, “Lexicographic optima of a multicriterial problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:2 (1997),  3–14  mathnet  mathscinet
83. V. A. Emelichev, O. A. Yanushkevich, “Pareto-optimality conditions in discrete vector optimization problems”, Diskr. Mat., 9:3 (1997),  153–160  mathnet  mathscinet  zmath; Discrete Math. Appl., 7:4 (1997), 345–352
84. 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
1995
85. 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
86. 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
87. 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
1994
88. 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
89. V. A. Emelichev, V. A. Perepelitsa, “Complexity of discrete multicriterial problems”, Diskr. Mat., 6:1 (1994),  3–33  mathnet  mathscinet  zmath; Discrete Math. Appl., 4:2 (1994), 89–117
90. 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
1992
91. 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
1991
92. V. A. Emelichev, V. A. Perepelitsa, “On the power of sets of alternatives in discrete multicriterial problems”, Diskr. Mat., 3:3 (1991),  3–12  mathnet  mathscinet  zmath; Discrete Math. Appl., 2:5 (1992), 461–471
93. 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
1990
94. V. A. Emelichev, M. M. Kovalev, A. B. Ramazanov, “The error of gradient extrema of the strongly convex function of a discrete argument”, Diskr. Mat., 2:2 (1990),  127–137  mathnet  mathscinet  zmath; Discrete Math. Appl., 2:2 (1992), 119–131
1989
95. V. A. Emelichev, V. A. Perepelitsa, “On some algorithmic problems of multicriterion optimization on graphs”, Zh. Vychisl. Mat. Mat. Fiz., 29:2 (1989),  171–183  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 29:1 (1989), 117–125
1988
96. V. A. Emelichev, V. A. Perepelitsa, “Multicriteria problems on graph spanning trees”, Dokl. Akad. Nauk SSSR, 298:3 (1988),  544–547  mathnet  mathscinet  zmath; Dokl. Math., 37:1 (1988), 114–117
1985
97. 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
1978
98. 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
99. 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
1973
100. V. A. Emelichev, I. M. Kraverskii, “A computer experiment on the solution of integer linear programming problems by the construction of a sequence of plans”, Zh. Vychisl. Mat. Mat. Fiz., 13:2 (1973),  467–471  mathnet  zmath; U.S.S.R. Comput. Math. Math. Phys., 13:2 (1973), 248–253
1972
101. V. A. Emelichev, M. M. Kovalev, “Local minima in the transport problem with a target function that is concave in the sense of Schur”, Zh. Vychisl. Mat. Mat. Fiz., 12:5 (1972),  1312–1316  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 12:5 (1972), 282–288
1971
102. V. A. Emelichev, “On the theory of discrete optimization”, Dokl. Akad. Nauk SSSR, 198:2 (1971),  273–276  mathnet  mathscinet  zmath
1970
103. V. A. Emelichev, “Problems of discrete optimization”, Dokl. Akad. Nauk SSSR, 192:5 (1970),  1002–1003  mathnet  mathscinet  zmath
1969
104. V. A. Emelichev, V. I. Komlik, “A solution of a discrete programming problem by the method of constructing a sequence of plans”, Dokl. Akad. Nauk SSSR, 188:2 (1969),  272–273  mathnet  mathscinet  zmath
1963
105. V. A. Emelichev, “On the algorithmic solvability of certain mass problems in the theory of commutative semigroups”, Sibirsk. Mat. Zh., 4:4 (1963),  788–798  mathnet  mathscinet  zmath
1962
106. V. A. Emelichev, “The solution of certain algorithmic problems for commutative semigroups”, Dokl. Akad. Nauk SSSR, 144:2 (1962),  261–263  mathnet  mathscinet  zmath

2016
107. S. A. Aivazyan, V. B. Alekseev, V. A. Vatutin, M. M. Glukhov, A. A. Grusho, V. A. Emelichev, A. M. Zubkov, G. I. Ivchenko, O. M. Kasim-zade, V. A. Kashtanov, I. N. Kovalenko, V. B. Kudryavtsev, V. V. Mazalov, Yu. V. Matiyasevich, Yu. I. Medvedev, V. G. Mikhailov, Yu. L. Pavlov, B. A. Pogorelov, È. A. Primenko, L. Ya. Savel'ev, V. N. Sachkov, S. A. Stepanov, V. P. Chistyakov, V. N. Chubarikov, “Валентин Федорович Колчин (1934–2016)”, Diskr. Mat., 28:4 (2016),  3–5  mathnet  mathscinet  elib
1999
108. V. A. Emelichev, D. P. Podkopaev, “Corrections to: “On a quantitative measure of the stability of a vector problem of integer programming””, Zh. Vychisl. Mat. Mat. Fiz., 39:3 (1999),  544  mathnet  mathscinet
1971
109. V. A. Emelichev, “Поправки к статье “К задачам дискретной оптимизации” (ДАН, т. 192, № 5, 1970 г.)”, Dokl. Akad. Nauk SSSR, 199:3 (1971),  8  mathnet

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021