Yuri Ogorodnikov

Orcid: 0000-0002-1750-1368

According to our database1, Yuri Ogorodnikov authored at least 9 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Reliable Production Process Design Problem: Compact MILP Model and ALNS-Based Primal Heuristic.
Proceedings of the Optimization and Applications - 14th International Conference, 2023

2021
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension.
J. Glob. Optim., 2021

The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

2020
An Extension of the Das and Mathieu QPTAS to the Case of Polylog Capacity Constrained CVRP in Metric Spaces of a Fixed Doubling Dimension.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

QPTAS for the CVRP with a Moderate Number of Routes in a Metric Space of Any Fixed Doubling Dimension.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019
Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand.
Proceedings of the Analysis of Images, Social Networks and Texts, 2019

2018
Efficient PTAS for the Euclidean CVRP with Time Windows.
Proceedings of the Analysis of Images, Social Networks and Texts, 2018


  Loading...