default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan A. Davydov
Person information
- affiliation: Novosibirsk State University, Russia
- 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
[j7]Ivan A. Davydov, Yury Kochetov
, Daniil Tolstykh, Xialiang Tong, Jiawen Liu:
Hybrid variable neighborhood search for automated warehouse scheduling. Optim. Lett. 17(9): 2185-2199 (2023)
2010 – 2019
- 2019
- [c5]Ivan A. Davydov, Petr Gusev:
Local Search Approach for the (r|p)-Centroid Problem Under ℓ 1 Metric. ICVNS 2019: 81-94 - [c4]Ivan A. Davydov, Daniil Tolstykh:
An Evolutionary Based Approach for the Traffic Lights Optimization Problem. MOTOR (2) 2019: 19-29 - 2017
- [j6]Ivan A. Davydov, Andrey A. Melnikov, Polina A. Kononova:
Local search for load balancing problems for servers with large dimension. Autom. Remote. Control. 78(3): 412-424 (2017) - 2016
- [c3]Ivan A. Davydov, Marceau Coupechoux, Stefano Iellamo:
Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem. DOOR 2016: 364-372 - [e1]Alexander V. Kononov, Igor A. Bykadorov, Oleg V. Khamisov, Ivan A. Davydov, Polina A. Kononova:
Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19 - 23, 2016. CEUR Workshop Proceedings 1623, CEUR-WS.org 2016 [contents] - 2015
- [j5]Ivan A. Davydov, Yury Kochetov:
VNS-based heuristic with an exponential neighborhood for the server load balancing problem. Electron. Notes Discret. Math. 47: 53-60 (2015) - [c2]Marceau Coupechoux, Ivan A. Davydov, Stefano Iellamo:
Tabu Search Heuristic for Competitive Base Station Location Problem. OR 2015: 325-330 - 2014
- [j4]Ivan A. Davydov, Yury A. Kochetov, Nenad Mladenovic, Dragan Urosevic:
Fast metaheuristics for the discrete (r|p)-centroid problem. Autom. Remote. Control. 75(4): 677-687 (2014) - [j3]Ivan A. Davydov, Yury A. Kochetov, Nenad Mladenovic, Dragan Urosevic:
Erratum to: "Fast metaheuristics for the discrete (r|p)-centroid problem". Autom. Remote. Control. 75(7): 1356 (2014) - [j2]Ivan A. Davydov, Yury Kochetov, Emilio Carrizosa:
A local search heuristic for the (r|p)-centroid problem in the plane. Comput. Oper. Res. 52: 334-340 (2014) - 2012
- [j1]Ivan A. Davydov, Yury Kochetov, Emilio Carrizosa:
VNS heuristic for the (r|p)-centroid problem on the plane. Electron. Notes Discret. Math. 39: 5-12 (2012) - 2011
- [c1]Emilio Carrizosa, Ivan A. Davydov, Yury Kochetov:
A new alternating heuristic for the (r | p)-centroid problem on the plane. OR 2011: 275-280
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 2024-04-24 23:10 CEST 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:
