Vladimir L. Beresnev

发表

Polynomially Solvable Cases of the Simple Plant Location Problem

Alexander A. Ageev, Vladimir L. Beresnev, 1990, IPCO.

Upper Bound for the Capacitated Competitive Facility Location Problem

Vladimir L. Beresnev, Andrey A. Melnikov, 2015, OR.

Branch-and-bound algorithm for a competitive facility location problem

Vladimir L. Beresnev, V. Beresnev, 2013, Comput. Oper. Res..

Facility Location in Unfair Competition

Vladimir L. Beresnev, Andrey A. Melnikov, 2016, DOOR.

\(\varepsilon \)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario

Vladimir L. Beresnev, Andrey A. Melnikov, 2020, EURO J. Comput. Optim..

Exact method for the capacitated competitive facility location problem

Vladimir L. Beresnev, Andrey A. Melnikov, 2018, Comput. Oper. Res..

An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix

Vladimir L. Beresnev, 2001, Discret. Appl. Math..

On the competitive facility location problem with a free choice of suppliers

Vladimir L. Beresnev, 2014, Autom. Remote. Control..

Approximation of the competitive facility location problem with MIPs

Vladimir L. Beresnev, Andrey A. Melnikov, 2019, Comput. Oper. Res..

Upper Bound for the Competitive Facility Location Problem with Quantile Criterion

Vladimir L. Beresnev, Andrey A. Melnikov, 2016, DOOR.