default search action
Vladimir L. Beresnev
Person information
- affiliation: Russian Academy of Sciences, Siberian Branch, Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c5]Vladimir L. Beresnev
, Andrey A. Melnikov
Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game. OPTIMA 2023: 3-13 - 2020
- [j6]Vladimir L. Beresnev, Andrey A. Melnikov
\(\varepsilon \)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario. EURO J. Comput. Optim. 8(1): 33-59 (2020)
2010 – 2019
- 2019
- [j5]Vladimir L. Beresnev, Andrey A. Melnikov
Approximation of the competitive facility location problem with MIPs. Comput. Oper. Res. 104: 139-148 (2019) - 2018
- [j4]Vladimir L. Beresnev, Andrey A. Melnikov
Exact method for the capacitated competitive facility location problem. Comput. Oper. Res. 95: 73-82 (2018) - 2016
- [c4]Vladimir L. Beresnev, Andrey A. Melnikov
Facility Location in Unfair Competition. DOOR 2016: 325-335 - [c3]Andrey A. Melnikov
Upper Bound for the Competitive Facility Location Problem with Quantile Criterion. DOOR 2016: 373-387 - [e1]Yury Kochetov, Michael Yu. Khachay, Vladimir L. Beresnev, Evgeni A. Nurminski, Panos M. Pardalos:
Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings. Lecture Notes in Computer Science 9869, Springer 2016, ISBN 978-3-319-44913-5 [contents] - 2015
- [c2]Vladimir L. Beresnev, Andrey A. Melnikov:
Upper Bound for the Capacitated Competitive Facility Location Problem. OR 2015: 87-93 - 2014
- [j3]Vladimir L. Beresnev:
On the competitive facility location problem with a free choice of suppliers. Autom. Remote. Control. 75(4): 668-676 (2014) - 2013
- [j2]Vladimir L. Beresnev:
Branch-and-bound algorithm for a competitive facility location problem. Comput. Oper. Res. 40(8): 2062-2070 (2013)
2000 – 2009
- 2001
- [j1]Vladimir L. Beresnev:
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix. Discret. Appl. Math. 114(1-3): 13-22 (2001)
1990 – 1999
- 1990
- [c1]Alexander A. Ageev, Vladimir L. Beresnev:
Polynomially Solvable Cases of the Simple Plant Location Problem. IPCO 1990: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: