|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
V. L. Beresnev, A. A. Melnikov, S. Yu. Utyupin, “Stability of vertex covers in a game with finitely many steps”, Diskretn. Anal. Issled. Oper., 31:2 (2024), 28–45  ; J. Appl. Industr. Math., 18:2 (2024), 206–215 |
|
2023 |
| 2. |
V. L. Beresnev, A. A. Melnikov, “Additional constraints for dynamic competitive facility location problem”, Diskretn. Anal. Issled. Oper., 30:3 (2023), 43–56 |
| 3. |
V. L. Beresnev, A. A. Melnikov, “Upper bound for the competitive facility location problem with demand uncertainty”, Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023), 20–25  ; Dokl. Math., 108:3 (2023), 438–442 |
|
2022 |
| 4. |
V. L. Beresnev, A. A. Melnikov, “Computing an upper bound in the two-stage bi-level competitive location model”, Diskretn. Anal. Issled. Oper., 29:3 (2022), 7–23  |
|
2020 |
| 5. |
V. L. Beresnev, A. A. Melnikov, “Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction”, Diskretn. Anal. Issled. Oper., 27:3 (2020), 5–27 ; J. Appl. Industr. Math., 14:3 (2020), 416–429  |
|
2019 |
| 6. |
V. L. Beresnev, A. A. Melnikov, “A bilevel “Attacker–Defender” model to choosing the composition of attack means”, Diskretn. Anal. Issled. Oper., 26:4 (2019), 16–33 |
| 7. |
V. L. Beresnev, A. A. Melnikov, “A cut generation algorithm of finding an optimal solution in a market competition”, Diskretn. Anal. Issled. Oper., 26:2 (2019), 5–29 ; J. Appl. Industr. Math., 13:2 (2019), 194–207 |
1
|
|
2018 |
| 8. |
V. L. Beresnev, I. A. Davydov, P. A. Kononova, A. A. Melnikov, “Bilevel “defender–attacker” model with multiple attack scenarios”, Diskretn. Anal. Issled. Oper., 25:3 (2018), 5–22 ; J. Appl. Industr. Math., 12:3 (2018), 417–425 |
3
|
|
2017 |
| 9. |
I. A. Davydov, A. A. Melnikov, P. A. Kononova, “Local search for load balancing problems for servers with large dimension”, Avtomat. i Telemekh., 2017, no. 3, 34–50 ; Autom. Remote Control, 78:3 (2017), 412–424  |
2
|
| 10. |
V. L. Beresnev, A. A. Melnikov, “An upper bound for the competitive location and capacity choice problem with multiple demand scenarios”, Diskretn. Anal. Issled. Oper., 24:4 (2017), 5–21 ; J. Appl. Industr. Math., 11:4 (2017), 472–480 |
3
|
|
2016 |
| 11. |
V. L. Beresnev, A. A. Melnikov, “A capacitated competitive facility location problem”, Diskretn. Anal. Issled. Oper., 23:1 (2016), 35–50 ; J. Appl. Industr. Math., 10:1 (2016), 61–68 |
5
|
|
2014 |
| 12. |
A. A. Mel'nikov, “Randomized local search for the discrete competitive facility location problem”, Avtomat. i Telemekh., 2014, no. 4, 134–152 ; Autom. Remote Control, 75:4 (2014), 700–714 |
27
|
| 13. |
A. A. Mel'nikov, “Computational complexity of the discrete competitive facility location problem”, Diskretn. Anal. Issled. Oper., 21:4 (2014), 62–79 ; J. Appl. Industr. Math., 8:4 (2014), 557–567 |
14
|
| 14. |
V. L. Beresnev, A. A. Melnikov, “Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers”, Diskretn. Anal. Issled. Oper., 21:2 (2014), 3–23 ; J. Appl. Industr. Math., 8:2 (2014), 177–189 |
15
|
|
2011 |
| 15. |
V. L. Beresnev, E. N. Goncharov, A. A. Mel'nikov, “Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 3–16  ; J. Appl. Industr. Math., 6:1 (2012), 22–30 |
9
|
|
2010 |
| 16. |
V. L. Beresnev, A. A. Melnikov, “Approximation algorithms for the competitive facility location problem”, Diskretn. Anal. Issled. Oper., 17:6 (2010), 3–19 |
14
|
|
| Organisations |
|
| |
|
|
Contact us: