Efficient PTAS for the Euclidean CVRP with Time Windows. - Michael Yu. Khachay; Yuri Ogorodnikov (AIST, 2018)

Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand. - Michael Yu. Khachay; Yuri Ogorodnikov (AIST, 2019)

PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows. - Michael Yu. Khachay; Yuri Ogorodnikov (LION, 2019)

Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand. - Michael Yu. Khachay; Yuri Ogorodnikov (MOTOR, 2019)

QPTAS for the CVRP with a Moderate Number of Routes in a Metric Space of Any Fixed Doubling Dimension. - Michael Yu. Khachay; Yuri Ogorodnikov (LION, 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. - Michael Yu. Khachay; Yuri Ogorodnikov; Daniel Khachay (MOTOR, 2020)

The Shortest Simple Path Problem with a Fixed Number of Must-Pass Nodes: A Problem-Specific Branch-and-Bound Algorithm. - Andrei Kudriavtsev; Daniel Khachay; Yuri Ogorodnikov; Jie Ren; Sheng Cheng Shao; Dong Zhang; Mikhail Yu. Khachay (LION, 2021)

Efficient approximation of the metric CVRP in spaces of fixed doubling dimension. - Mikhail Yu. Khachay; Yuri Ogorodnikov; Daniel Khachay (J. Glob. Optim., 2021)

Reliable Production Process Design Problem: Compact MILP Model and ALNS-Based Primal Heuristic. - Roman Rudakov; Daniil Khachai; Yuri Ogorodnikov; Michael Yu. Khachay (OPTIMA, 2023)