We stand with Ukraine  

Vladimir L. Beresnev

Orcid: 0000-0001-5598-3399

Affiliations:
  • Russian Academy of Sciences, Siberian Branch, Sobolev Institute of Mathematics, Novosibirsk, Russia


According to our database1, Vladimir L. Beresnev authored at least 11 papers between 1990 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game.
[BibTeX]
[DOI]
Vladimir L. Beresnev
,
Andrey A. Melnikov
,
Stepan Utyupin
Proceedings of the Optimization and Applications - 14th International Conference, 2023

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

2019
Approximation of the competitive facility location problem with MIPs.
[BibTeX]
[DOI]
Vladimir L. Beresnev
,
Andrey A. Melnikov
Comput. Oper. Res., 2019

2018
Exact method for the capacitated competitive facility location problem.
[BibTeX]
[DOI]
Vladimir L. Beresnev
,
Andrey A. Melnikov
Comput. Oper. Res., 2018

2016
Upper Bound for the Competitive Facility Location Problem with Quantile Criterion.
[BibTeX]
[DOI]
Andrey A. Melnikov
,
Vladimir L. Beresnev
Proceedings of the Discrete Optimization and Operations Research, 2016

Facility Location in Unfair Competition.
[BibTeX]
[DOI]
Vladimir L. Beresnev
,
Andrey A. Melnikov
Proceedings of the Discrete Optimization and Operations Research, 2016

2015
Upper Bound for the Capacitated Competitive Facility Location Problem.
[BibTeX]
[DOI]
Vladimir L. Beresnev
,
Andrey A. Melnikov
Proceedings of the Operations Research Proceedings 2015, 2015

2014
On the competitive facility location problem with a free choice of suppliers.
[BibTeX]
[DOI]
Vladimir L. Beresnev
Autom. Remote. Control., 2014

2013
Branch-and-bound algorithm for a competitive facility location problem.
[BibTeX]
[DOI]
Vladimir L. Beresnev
Comput. Oper. Res., 2013

2001
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix.
[BibTeX]
[DOI]
Vladimir L. Beresnev
Discret. Appl. Math., 2001

1990
Polynomially Solvable Cases of the Simple Plant Location Problem.
[BibTeX]
Alexander A. Ageev
,
Vladimir L. Beresnev
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990


  Loading...