Michael Khachay
Michael Khachay
Prof., Head of Math. Prog. Lab at Krasovsky Inst. of Math. and Mech., PhD, Dr. habil.
Verified email at imm.uran.ru - Homepage
Title
Cited by
Cited by
Year
Committee constructions for solving problems of selection, diagnostics, and prediction
MY Khachai, VD Mazurov, AI Rybin
Proc. Steklov Institute Math, 67-101, 2002
75*2002
Математические методы в экономике
РС Бубнов, МН Уварова
Физика и современные технологии в АПК, 27, 2016
312016
Экстремальные задачи на множествах перестановок
ЭХ Гимади, МЮ Хачай
Екатеринбург: УМЦ УПИ, 2016
28*2016
Комитетные конструкции
ВД Мазуров, МЮ Хачай
Известия Уральского государственного университета. 1999.№ 14, 1999
281999
PTAS for the Euclidean Capacitated Vehicle Routing Problem in
M Khachay, R Dubinin
International Conference on Discrete Optimization and Operations Research …, 2016
262016
Linear time algorithm for precedence constrained asymmetric generalized traveling salesman problem
A Chentsov, M Khachay, D Khachay
IFAC-PapersOnLine 49 (12), 651-655, 2016
262016
Committees of systems of linear inequalities
VD Mazurov, MY Khachai
Automation and Remote Control 65 (2), 193-203, 2004
25*2004
Complexity and approximability of committee polyhedral separability of sets in general position
M Khachay, M Poberii
Informatica 20 (2), 217-234, 2009
242009
Approximability of the minimum-weight k-size cycle cover problem
M Khachay, K Neznakhina
Journal of Global Optimization 66 (1), 65-82, 2016
222016
О ВЫЧИСЛИТЕЛЬНОЙ СЛОЖНОСТИ ЗАДАЧИ О МИНИМАЛЬНОМ КОМИТЕТЕ СИСТЕМЫ ЛИНЕЙНЫХ НЕРАВЕНСТВ1
МЮ Хачай
Математическое программирование: Труды XIII Байкальской международной школы …, 2006
202006
On approximate algorithm of a minimal committee of a linear inequalities system
MY Khachay
Pattern Recognition and Image Analysis 13 (3), 459-464, 2003
202003
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
20*1997
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 (1), 38-46, 2016
19*2016
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 (1), 111-125, 2015
19*2015
Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets
MY Khachai
Pattern Recognition and Image Analysis 18 (2), 236-242, 2008
192008
On the existence of majority committee
MY Khachai
Discrete Mathematics and Applications 7, 383-398, 1997
19*1997
Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
M Khachay, H Zaytseva
Combinatorial Optimization and Applications, 178-190, 2015
182015
2-Approximation algorithm for finding a clique with minimum weight of vertices and edges
II Eremin, EK Gimadi, AV Kel’Manov, AV Pyatkin, MY Khachai
Proceedings of the Steklov Institute of Mathematics 284 (1), 87-95, 2014
18*2014
Parallel computations and committee constructions
VD Mazurov, MY Khachai
Automation and Remote Control 68 (5), 912-921, 2007
18*2007
On the computational and approximational complexity of the minimum affine separating committee problem
MY Khachay
Tavricheskii Vestnik Informatiki i Matematiki 1, 34-43, 2006
17*2006
The system can't perform the operation now. Try again later.
Articles 1–20