Daniil Khachai
Daniil Khachai
PhD, Research Assistant, KEDGE Business School
Verified email at - Homepage
Cited by
Cited by
Linear time algorithm for precedence constrained asymmetric generalized traveling salesman problem
A Chentsov, M Khachay, D Khachay
IFAC-PapersOnLine 49 (12), 651-655, 2016
An exact algorithm with linear complexity for a problem of visiting megalopolises
AG Chentsov, MY Khachai, DM Khachai
Proceedings of the Steklov Institute of Mathematics 295, 38-46, 2016
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
M Khachay, Y Ogorodnikov, D Khachay
Journal of Global Optimization 80 (3), 679-710, 2021
Program iterations method and relaxation of a pursuit-evasion differential game
A Chentsov, D Khachay
Advanced Control Techniques in Complex Engineering Systems: Theory and …, 2019
Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm
D Khachai, R Sadykov, O Battaia, M Khachay
European Journal of Operational Research 309 (2), 488-505, 2023
Attainable accuracy guarantee for the k-medians clustering in [0, 1]
M Khachay, D Khachay
Optimization Letters 13, 1837-1853, 2019
Relaxation of a differential game of approach-evasion and iterative methods
AG Chentsov, DM Khachai
Trudy Instituta Matematiki i Mekhaniki UrO RAN 24 (4), 246-269, 2018
An extension of the das and mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
M Khachay, Y Ogorodnikov, D Khachay
International Conference on Mathematical Optimization Theory and Operations …, 2020
Relaxation of the pursuit–evasion differential game and iterative methods
AG Chentsov, DM Khachay
Proceedings of the Steklov Institute of Mathematics 308, 35-57, 2020
Relaxation of pursuit-evasion differential game and program absorption operator
AG Chentsov, DM Khachai
Udmurt State University 1 (30), 64-91, 2020
Attainable best guarantee for the accuracy of k-medians clustering in [0, 1]
M Khachay, V Pankratov, D Khachay
CEUR Workshop Proceedings 1987, 322-327, 2017
Integer partition problem: Theoretical approach to improving accuracy of classifier ensembles
M Khachay, M Pobery, D Khachay
International J. of Artificial Intelligence 13 (1), 135-146, 2015
The shortest simple path problem with a fixed number of must-pass nodes: a problem-specific branch-and-bound algorithm
A Kudriavtsev, D Khachay, Y Ogorodnikov, J Ren, SC Shao, D Zhang, ...
Learning and Intelligent Optimization: 15th International Conference, LION …, 2021
Эффективный метод решения задачи обхода мегаполисов при ограничениях предшествования специального типа
АГ Ченцов, ДМ Хачай
Современные проблемы математики и ее приложения. Труды, 47-1, 2016
A problem-specific branch-and-bound algorithm for the protected shortest simple path problem with must-pass nodes
Y Ogorodnikov, R Rudakov, D Khachai, M Khachay
IFAC-PapersOnLine 55 (10), 572-577, 2022
Relaxation of a dynamic game of guidance and program constructions of control
AG Chentsov, DM Khachay
Minimax Theory and its Applications 5 (2), 275-304, 2020
Towards a relaxation of the pursuit-evasion differential game
A Chentsov, D Khachay
IFAC-PapersOnLine 52 (13), 2303-2307, 2019
On parameterized complexity of hitting set problem for axis-parallel squares intersecting a straight line
Ural Mathematical Journal 2 (2 (3)), 117-126, 2016
Efficient Algorithms for Routing Problems with Specific Constraints
D Khachai
Université de Bordeaux, 2023
Algorithmes efficaces pour les problèmes de routage avec des contraintes spécifiques
D Khachai
Bordeaux, 2023
The system can't perform the operation now. Try again later.
Articles 1–20