Michael Khachay
Michael Khachay
Prof., Corr. memb. of RAS, Head of Math. Prog. Lab at Krasovsky Inst. of Math. and Mech. RAS
Verified email at - Homepage
Cited by
Cited by
Committee constructions for solving problems of selection, diagnostics, and prediction
MY Khachai, VD Mazurov, AI Rybin
Proc. Steklov Institute Math, 67-101, 2002
Экстремальные задачи на множествах перестановок
ЭХ Гимади, МЮ Хачай
Екатеринбург: УМЦ УПИ, 2016
PTAS for the Euclidean capacitated vehicle routing problem in
M Khachay, R Dubinin
International Conference on Discrete Optimization and Operations Research …, 2016
Linear time algorithm for precedence constrained asymmetric generalized traveling salesman problem
A Chentsov, M Khachay, D Khachay
IFAC-PapersOnLine 49 (12), 651-655, 2016
Committees of systems of linear inequalities
VD Mazurov, MY Khachai
Automation and Remote Control 65, 193-203, 2004
Computational complexity of the minimum committee problem and related problems
MY Khachai
Doklady Mathematics 73, 138-141, 2006
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
Approximability of the minimum-weight k-size cycle cover problem
M Khachay, K Neznakhina
Journal of Global Optimization 66, 65-82, 2016
Математические методы в экономике
РС Бубнов, МН Уварова
Физика и современные технологии в АПК, 27-31, 2016
Комитетные конструкции
ВД Мазуров, МЮ Хачай
Известия Уральского государственного университета. 1999.№ 14, 1999
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
M Khachay, K Neznakhina
Annals of Mathematics and Artificial Intelligence 88 (1), 53-69, 2020
Approximation schemes for the generalized traveling salesman problem
MY Khachai, ED Neznakhina
Proceedings of the Steklov Institute of Mathematics 299, 97-105, 2017
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
MY Khachai, ED Neznakhina
Proceedings of the Steklov Institute of Mathematics 289, 111-125, 2015
Towards tractability of the Euclidean generalized traveling salesman problem in grid clusters defined by a grid of bounded height
M Khachay, K Neznakhina
International Conference on Optimization Problems and Their Applications, 68-77, 2018
Complexity and approximability of committee polyhedral separability of sets in general position
M Khachay, M Poberii
Informatica 20 (2), 217-234, 2009
Estimate of the number of members in the minimal committee of a system of linear inequalities
MY Khachay
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 37 (11), 1399-1404, 1997
Approximability of the problem about a minimum-weight cycle cover of a graph
MY Khachai, ED Neznakhina
Doklady Mathematics 91, 240-245, 2015
Efficient PTAS for the Euclidean CVRP with time windows
M Khachay, Y Ogorodnikov
International Conference on Analysis of Images, Social Networks and Texts …, 2018
Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
M Khachay, H Zaytseva
Combinatorial Optimization and Applications: 9th International Conference …, 2015
On approximate algorithm of a minimal committee of a linear inequalities system
MY Khachay
Pattern Recognition and Image Analysis 13 (3), 459-464, 2003
The system can't perform the operation now. Try again later.
Articles 1–20