Polynomially Solvable Cases of the Simple Plant Location Problem. - Alexander A. Ageev; Vladimir L. Beresnev (IPCO, 1990)

An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix. - Vladimir L. Beresnev (Discret. Appl. Math., 2001)

Branch-and-bound algorithm for a competitive facility location problem. - Vladimir L. Beresnev (Comput. Oper. Res., 2013)

On the competitive facility location problem with a free choice of suppliers. - Vladimir L. Beresnev (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)

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

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)