|
|
|
Publications in Math-Net.Ru |
Citations |
|
2021 |
| 1. |
I. L. Vasilyev, A. V. Ushakov, “Discrete facility location in machine learning”, Diskretn. Anal. Issled. Oper., 28:4 (2021), 5–60  |
1
|
|
2016 |
| 2. |
I. L. Vasilyev, P. Avella, M. Boccia, “A branch and cut heuristic for a runway scheduling problem”, Avtomat. i Telemekh., 2016, no. 11, 131–141  ; Autom. Remote Control, 77:11 (2016), 1985–1993   |
2
|
|
2013 |
| 3. |
I. L. Vasiliev, A. V. Ushakov, “A parallel implementation of the subgradient algorithm for maximizing the Lagrangian dual function in the $p$-median problem”, Num. Meth. Prog., 14:1 (2013), 9–16 |
|
2012 |
| 4. |
I. L. Vasilyev, A. V. Ushakov, “On an approach to the robustness in the case of the $p$-median problem”, Bulletin of Irkutsk State University. Series Mathematics, 5:4 (2012), 2–15 |
|
2011 |
| 5. |
I. L. Vasiliev, A. V. Ushakov, “Lagrangian relaxations for the nonlinear $p$-median problem”, Bulletin of Irkutsk State University. Series Mathematics, 4:2 (2011), 45–59 |
|
2009 |
| 6. |
I. L. Vasiliev, K. B. Klimentova, “A branch and bound method for the facility location problem with customer preferences”, Diskretn. Anal. Issled. Oper., 16:2 (2009), 21–41   ; J. Appl. Industr. Math., 4:3 (2010), 441–454 |
32
|
| 7. |
I. L. Vasiliev, K. B. Klimentova, Yu. A. Kochetov, “New lower bounds for the facility location problem with clients' preferences”, Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009), 1055–1066 ; Comput. Math. Math. Phys., 49:6 (2009), 1010–1020 |
30
|
|
2007 |
| 8. |
I. L. Vasiliev, “Метод декомпозиции для задачи о $p$-медиане на несвязном графе”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 43–58 |
| 9. |
I. L. Vasiliev, D. N. Sidorov, “Cluster analysis application to automatic flaw detection”, Probl. Upr., 2007, no. 4, 36–42 |
1
|
| 10. |
I. L. Vasiliev, K. B. Klimentova, A. V. Orlov, “A parallel search of equilibrium points in bimatrix games”, Num. Meth. Prog., 8:3 (2007), 233–243 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: