Randomized local search for the discrete competitive facility location problem. - Andrey A. Melnikov (Autom. Remote. Control., 2014)

Upper Bound for the Capacitated Competitive Facility Location Problem. - Vladimir L. Beresnev; Andrey A. Melnikov (OR, 2015)

Facility Location in Unfair Competition. - Vladimir L. Beresnev; Andrey A. Melnikov (DOOR, 2016)

Upper Bound for the Competitive Facility Location Problem with Quantile Criterion. - Andrey A. Melnikov; Vladimir L. Beresnev (DOOR, 2016)

Local search for load balancing problems for servers with large dimension. - Ivan A. Davydov; Andrey A. Melnikov; Polina A. Kononova (Autom. Remote. Control., 2017)

Exact method for the capacitated competitive facility location problem. - Vladimir L. Beresnev; Andrey A. Melnikov (Comput. Oper. Res., 2018)

Local Search Approach for the Medianoid Problem with Multi-purpose Shopping Trips. - Sergey Khapugin; Andrey A. Melnikov (MOTOR, 2019)

Approximation of the competitive facility location problem with MIPs. - Vladimir L. Beresnev; Andrey A. Melnikov (Comput. Oper. Res., 2019)

( varepsilon )-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario. - Vladimir L. Beresnev; Andrey A. Melnikov (EURO J. Comput. Optim., 2020)

Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game. - Vladimir L. Beresnev; Andrey A. Melnikov; Stepan Utyupin (OPTIMA, 2023)

Two-Stage Algorithm for Bi-objective Black-Box Traffic Engineering. - Alexander Yuskov; Igor Kulachenko; Andrey A. Melnikov; Yury Kochetov 001 (OPTIMA, 2023)