![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Yuri Ogorodnikov
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]Roman Rudakov, Daniil Khachai
, Yuri Ogorodnikov
, Michael Yu. Khachay
:
Reliable Production Process Design Problem: Compact MILP Model and ALNS-Based Primal Heuristic. OPTIMA 2023: 174-188 - 2021
- [j1]Mikhail Yu. Khachay
, Yuri Ogorodnikov
, Daniel Khachay
:
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension. J. Glob. Optim. 80(3): 679-710 (2021) - [c7]Andrei Kudriavtsev
, Daniel Khachay
, Yuri Ogorodnikov
, Jie Ren, Sheng Cheng Shao, Dong Zhang, Mikhail Yu. Khachay
:
The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm. LION 2021: 198-210 - 2020
- [c6]Michael Yu. Khachay
, Yuri Ogorodnikov
:
QPTAS for the CVRP with a Moderate Number of Routes in a Metric Space of Any Fixed Doubling Dimension. LION 2020: 27-32 - [c5]Michael Yu. Khachay
, Yuri Ogorodnikov
, Daniel Khachay
:
An Extension of the Das and Mathieu QPTAS to the Case of Polylog Capacity Constrained CVRP in Metric Spaces of a Fixed Doubling Dimension. MOTOR 2020: 49-68
2010 – 2019
- 2019
- [c4]Michael Yu. Khachay
, Yuri Ogorodnikov
:
Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand. AIST 2019: 388-398 - [c3]Michael Yu. Khachay
, Yuri Ogorodnikov
:
PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows. LION 2019: 224-230 - [c2]Michael Yu. Khachay
, Yuri Ogorodnikov
:
Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand. MOTOR 2019: 309-327 - 2018
- [c1]Michael Yu. Khachay
, Yuri Ogorodnikov
:
Efficient PTAS for the Euclidean CVRP with Time Windows. AIST 2018: 318-328
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint