Melnikov Andrei Andreevich

Publications in Math-Net.Ru

1. Decomposition approach for a two echelon inventory management system
   
   Diskretn. Anal. Issled. Oper., 31:4 (2024),  186–212
2. A branch, bound, and cuts algorithm for the dynamic competitive facility location problem
   
   Diskretn. Anal. Issled. Oper., 31:4 (2024),  5–26
3. Stability of vertex covers in a game with finitely many steps
   
   Diskretn. Anal. Issled. Oper., 31:2 (2024),  28–45
4. Upper bound procedure for dynamic competitive facility location problem with profit targeting
   
   Sib. Èlektron. Mat. Izv., 21:2 (2024),  960–971
5. Additional constraints for dynamic competitive facility location problem
   
   Diskretn. Anal. Issled. Oper., 30:3 (2023),  43–56
6. Upper bound for the competitive facility location problem with demand uncertainty
   
   Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023),  20–25
7. Computing an upper bound in the two-stage bi-level competitive location model
   
   Diskretn. Anal. Issled. Oper., 29:3 (2022),  7–23
8. 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
9. A bilevel “Attacker–Defender” model to choosing the composition of attack means
   
   Diskretn. Anal. Issled. Oper., 26:4 (2019),  16–33
10. A cut generation algorithm of finding an optimal solution in a market competition
    
    Diskretn. Anal. Issled. Oper., 26:2 (2019),  5–29
11. Bilevel “defender–attacker” model with multiple attack scenarios
    
    Diskretn. Anal. Issled. Oper., 25:3 (2018),  5–22
12. Local search for load balancing problems for servers with large dimension
    
    Avtomat. i Telemekh., 2017, no. 3,  34–50
13. An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
    
    Diskretn. Anal. Issled. Oper., 24:4 (2017),  5–21
14. A capacitated competitive facility location problem
    
    Diskretn. Anal. Issled. Oper., 23:1 (2016),  35–50
15. Randomized local search for the discrete competitive facility location problem
    
    Avtomat. i Telemekh., 2014, no. 4,  134–152
16. Computational complexity of the discrete competitive facility location problem
    
    Diskretn. Anal. Issled. Oper., 21:4 (2014),  62–79
17. Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers
    
    Diskretn. Anal. Issled. Oper., 21:2 (2014),  3–23
18. Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions
    
    Diskretn. Anal. Issled. Oper., 18:4 (2011),  3–16
19. Approximation algorithms for the competitive facility location problem
    
    Diskretn. Anal. Issled. Oper., 17:6 (2010),  3–19