Michael Khachay
Michael Khachay
Prof., Head of Math. Prog. Lab at Krasovsky Inst. of Math. and Mech., PhD, Dr. habil.
Bestätigte E-Mail-Adresse bei imm.uran.ru - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Committee constructions for solving problems of selection, diagnostics, and prediction
MY Khachai, VD Mazurov, AI Rybin
Proc. Steklov Institute Math, 67-101, 2002
76*2002
Linear time algorithm for precedence constrained asymmetric generalized traveling salesman problem
A Chentsov, M Khachay, D Khachay
IFAC-PapersOnLine 49 (12), 651-655, 2016
33*2016
PTAS for the Euclidean Capacitated Vehicle Routing Problem in
M Khachay, R Dubinin
International Conference on Discrete Optimization and Operations Research …, 2016
322016
Экстремальные задачи на множествах перестановок
ЭХ Гимади, МЮ Хачай
Екатеринбург: УМЦ УПИ, 2016
32*2016
Комитетные конструкции
ВД Мазуров, МЮ Хачай
Известия Уральского государственного университета. 1999.№ 14, 1999
31*1999
Математические методы в экономике
ИИ Еремин, ВД Мазуров, ВД Скарин, МЮ Хачай
Екатеринбург: УрГУ-Центр “Фактория Пресс, 2000
292000
Committees of systems of linear inequalities
VD Mazurov, MY Khachai
Automation and Remote Control 65 (2), 193-203, 2004
27*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
232016
Efficient PTAS for the Euclidean CVRP with time windows
M Khachay, Y Ogorodnikov
International Conference on Analysis of Images, Social Networks and Texts …, 2018
212018
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
21*2016
Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
M Khachay, H Zaytseva
Combinatorial Optimization and Applications, 178-190, 2015
212015
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
20*2015
О ВЫЧИСЛИТЕЛЬНОЙ СЛОЖНОСТИ ЗАДАЧИ О МИНИМАЛЬНОМ КОМИТЕТЕ СИСТЕМЫ ЛИНЕЙНЫХ НЕРАВЕНСТВ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
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
Parallel computations and committee constructions
VD Mazurov, MY Khachai
Automation and Remote Control 68 (5), 912-921, 2007
18*2007
On the existence of majority committee
MY Khachai
Walter de Gruyter, Berlin/New York 7 (4), 383-398, 1997
18*1997
Approximability of the problem about a minimum-weight cycle cover of a graph
MY Khachai, ED Neznakhina
Doklady Mathematics 91 (2), 240-245, 2015
17*2015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20