Vladimir L. Beresnev

12 papers B 1Journal 6Unranked 4
YearRankTypeTitle / Venue / Authors
2023 — conf
Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game.
OPTIMA
Vladimir L. Beresnev, Andrey A. Melnikov, Stepan Utyupin
2020 J jnl
\(\varepsilon \)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario.
EURO J. Comput. Optim.
Vladimir L. Beresnev, Andrey A. Melnikov
2019 J jnl
Approximation of the competitive facility location problem with MIPs.
Comput. Oper. Res.
Vladimir L. Beresnev, Andrey A. Melnikov
2018 J jnl
Exact method for the capacitated competitive facility location problem.
Comput. Oper. Res.
Vladimir L. Beresnev, Andrey A. Melnikov
2016 — ed.
Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings
DOOR
Yury Kochetov, Michael Yu. Khachay, Vladimir L. Beresnev, Evgeni A. Nurminski, Panos M. Pardalos
2016 — conf
Facility Location in Unfair Competition.
DOOR
Vladimir L. Beresnev, Andrey A. Melnikov
2016 — conf
Upper Bound for the Competitive Facility Location Problem with Quantile Criterion.
DOOR
Andrey A. Melnikov, Vladimir L. Beresnev
2015 — conf
Upper Bound for the Capacitated Competitive Facility Location Problem.
OR
Vladimir L. Beresnev, Andrey A. Melnikov
2014 J jnl
On the competitive facility location problem with a free choice of suppliers.
Autom. Remote. Control.
Vladimir L. Beresnev
2013 J jnl
Branch-and-bound algorithm for a competitive facility location problem.
Comput. Oper. Res.
Vladimir L. Beresnev
2001 J jnl
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix.
Discret. Appl. Math.
Vladimir L. Beresnev
1990 B conf
Polynomially Solvable Cases of the Simple Plant Location Problem.
IPCO
Alexander A. Ageev, Vladimir L. Beresnev