|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
1. |
V. N. Nefedov, “Median for an odd number of linear order relations and its use in group choice problems”, Prikl. Diskr. Mat., 2022, no. 57, 98–127 |
|
2019 |
2. |
V. N. Nefedov, “Some numerical second and third order accurate methods for approximate calculation of the probability measure of a polyhedron”, Zh. Vychisl. Mat. Mat. Fiz., 59:7 (2019), 1108–1124 ; Comput. Math. Math. Phys., 59:7 (2019), 1058–1073 |
3
|
|
2018 |
3. |
V. N. Nefyodov, V. A. Osipova, S. O. Smerchinskaya, N. P. Yashina, “Non-contradictory aggregations of relations of strict order”, Izv. Vyssh. Uchebn. Zaved. Mat., 2018, no. 5, 71–85 ; Russian Math. (Iz. VUZ), 62:5 (2018), 61–73 |
10
|
4. |
V. N. Nefedov, S. O. Smerchinskaya, N. P. Yashina, “Constructing an aggregated relation with a minimum distance from the expert preferences”, Prikl. Diskr. Mat., 2018, no. 42, 120–132 |
3
|
|
1993 |
5. |
V. N. Nefëdov, “The complexity of the computation of a global minimum in certain classes of optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 33:10 (1993), 1480–1498 ; Comput. Math. Math. Phys., 33:10 (1993), 1309–1322 |
|
1992 |
6. |
V. N. Nefëdov, “Some problems of solving Lipschitzian global optimization problems using the branch and bound method”, Zh. Vychisl. Mat. Mat. Fiz., 32:4 (1992), 512–529 ; Comput. Math. Math. Phys., 32:4 (1992), 433–445 |
2
|
|
1990 |
7. |
V. N. Nefedov, “A mathematical programming problem with a convex irregular feasible set”, Zh. Vychisl. Mat. Mat. Fiz., 30:6 (1990), 844–857 ; U.S.S.R. Comput. Math. Math. Phys., 30:3 (1990), 145–154 |
1
|
8. |
V. N. Nefedov, “Estimation of the error in convex polynomial optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 30:2 (1990), 200–216 ; U.S.S.R. Comput. Math. Math. Phys., 30:1 (1990), 147–158 |
3
|
|
1987 |
9. |
V. N. Nefedov, “Polynomial optimization problems”, Zh. Vychisl. Mat. Mat. Fiz., 27:5 (1987), 661–675 ; U.S.S.R. Comput. Math. Math. Phys., 27:3 (1987), 13–21 |
3
|
10. |
V. N. Nefedov, “Search for the global maximum of a function of several variables on a set defined by constraints of inequality type”, Zh. Vychisl. Mat. Mat. Fiz., 27:1 (1987), 35–51 ; U.S.S.R. Comput. Math. Math. Phys., 27:1 (1987), 23–32 |
8
|
|
1986 |
11. |
V. N. Nefedov, “Approximation of a set of Pareto-optimal solutions”, Zh. Vychisl. Mat. Mat. Fiz., 26:2 (1986), 163–176 ; U.S.S.R. Comput. Math. Math. Phys., 26:1 (1986), 99–107 |
2
|
|
1984 |
12. |
V. N. Nefedov, “Approximation of a Pareto set”, Zh. Vychisl. Mat. Mat. Fiz., 24:7 (1984), 993–1007 ; U.S.S.R. Comput. Math. Math. Phys., 24:4 (1984), 19–28 |
5
|
|
1983 |
13. |
V. N. Nefedov, “On regularization of lexicographic problems by the method of minimum concessions”, Zh. Vychisl. Mat. Mat. Fiz., 23:6 (1983), 1326–1340 ; U.S.S.R. Comput. Math. Math. Phys., 23:6 (1983), 27–36 |
2
|
14. |
V. N. Nefedov, “Calculation of the conditional minimum of a function with a given accuracy”, Zh. Vychisl. Mat. Mat. Fiz., 23:3 (1983), 590–601 ; U.S.S.R. Comput. Math. Math. Phys., 23:3 (1983), 47–55 |
|
1981 |
15. |
V. N. Nefedov, “Convex lexicographic problems”, Zh. Vychisl. Mat. Mat. Fiz., 21:4 (1981), 865–880 ; U.S.S.R. Comput. Math. Math. Phys., 21:4 (1981), 49–65 |
1
|
|
1979 |
16. |
V. N. Nefedov, “Methods of regularizing three-stage convex lexicographic problems”, Dokl. Akad. Nauk SSSR, 249:5 (1979), 1060–1063 |
|
|
|
2019 |
17. |
V. N. Nefedov, S. O. Smerchinskaya, N. P. Yashina, “Non-contradictory aggregation of quasi-order relations”, Prikl. Diskr. Mat., 2019, no. 45, 113–126 |
6
|
|
Organisations |
|
|
|
|