RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Khachay Mikhail Yur'evich

Statistics Math-Net.Ru
Total publications: 28
Scientific articles: 25
Presentations: 10

Number of views:
This page:2876
Abstract pages:4589
Full texts:1243
References:633
Professor of Russian Academy of Sciences
Doctor of physico-mathematical sciences
E-mail:
Website: http://tom.imm.uran.ru/khachay

http://www.mathnet.ru/eng/person28087
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:khachai.m-yu
https://mathscinet.ams.org/mathscinet/MRAuthorID/627744

Publications in Math-Net.Ru
1. Polynomial time approximation scheme for the capacitated vehicle routing problem with time windows
M. Yu. Khachay, Yu. Yu. Ogorodnikov
Trudy Inst. Mat. i Mekh. UrO RAN, 24:3 (2018),  233–246
2. Attainable best guarantee for the accuracy of $k$-medians clustering in $[0,1]$
M. Yu. Khachai, D. M. Khachai, V. S. Pankratov
Trudy Inst. Mat. i Mekh. UrO RAN, 23:4 (2017),  301–310
3. Solvability of the Generalized Traveling Salesman Problem in the class of quasi- and pseudopyramidal tours
M. Yu. Khachay, E. D. Neznakhina
Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  280–291
4. Approximation Schemes for the Generalized Traveling Salesman Problem
M. Yu. Khachai, E. D. Neznakhina
Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  283–292
5. Approximability of the optimal routing problem in finite-dimensional Euclidean spaces
M. Yu. Khachai, R. D. Dubinin
Trudy Inst. Mat. i Mekh. UrO RAN, 22:2 (2016),  292–303
6. On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line
Daniel M. Khachai, Michael Yu. Khachay
Ural Math. J., 2:2 (2016),  117–126
7. An exact algorithm with linear complexity for a problem of visiting megalopolises
A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  309–317
8. Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
M. Yu. Khachai, M. I. Poberii
Avtomat. i Telemekh., 2014, no. 4,  81–93
9. Polynomial-time approximation scheme for a Euclidean problem on a cycle covering of a graph
M. Yu. Khachai, E. D. Neznakhina
Trudy Inst. Mat. i Mekh. UrO RAN, 20:4 (2014),  297–311
10. Efficient algorithms with performance estimates for some problems of finding several cliques in a complete undirected weighted graph
E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  99–112
11. Boosting and the polynomial approximability of the problem on a minimum affine separating committee
Vl. D. Mazurov, M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  231–236
12. $2$-approximate algorithm for finding a clique with minimum weight of vertices and edges
I. I. Eremin, E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  134–143
13. Topological properties of measurable structures and sufficient conditions for uniform convergence of frequencies to probabilities
E. G. Pytkeev, M. Yu. Khachai
Avtomat. i Telemekh., 2012, no. 2,  89–98
14. The computational complexity and approximability of a series of geometric covering problems
M. Yu. Khachai, M. I. Poberii
Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  247–260
15. Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
M. Yu. Khachai
Avtomat. i Telemekh., 2010, no. 3,  178–189
16. Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  276–284
17. Sigma-compactness of metric Boolean algebras and uniform convergence of frequencies to probabilities
E. G. Pytkeev, M. Yu. Khachai
Trudy Inst. Mat. i Mekh. UrO RAN, 16:1 (2010),  127–139
18. Combinatorial optimization problems related to the committee polyhedral separability of finite sets
V. D. Mazurov, M. Yu. Khachai, M. I. Poberii
Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  89–102
19. Parallel computations and committee constructions
V. D. Mazurov, M. Yu. Khachai
Avtomat. i Telemekh., 2007, no. 5,  182–192
20. Committees of systems of linear inequalities
V. D. Mazurov, M. Yu. Khachai
Avtomat. i Telemekh., 2004, no. 2,  43–54
21. Committee constructions as a generalization of contradictory problems of operations research
V. D. Mazurov, M. Yu. Khachai
Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003),  56–66
22. Committee constructions for solving problems of selection, diagnostics, and prediction
V. D. Mazurov, M. Yu. Khachai, A. I. Rybin
Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002),  66–102
23. A game against nature associated with majority-vote decision making
M. Yu. Khachai
Zh. Vychisl. Mat. Mat. Fiz., 42:10 (2002),  1609–1616
24. On the existence of a majority committee
M. Yu. Khachai
Diskr. Mat., 9:3 (1997),  82–95
25. Estimate of the number of members in the minimal committee of a system of linear inequalities
M. Yu. Khachaĭ
Zh. Vychisl. Mat. Mat. Fiz., 37:11 (1997),  1399–1404

26. Ivan Ivanovich Eremin
V. I. Berdyshev, V. V. Vasin, S. V. Matveev, A. A. Makhnev, Yu. N. Subbotin, N. N. Subbotina, V. N. Ushakov, M. Yu. Khachai, A. G. Chentsov
Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  5–12
27. In memory of Ivan Ivanovich Eryomin (22.01.1933–21.07.2013)
Yu. G. Evtushenko, M. Yu. Khachai
Zh. Vychisl. Mat. Mat. Fiz., 54:5 (2014),  887–891
28. Mathematical Programming: State of the Art
A. I. Kibzun, E. A. Nurminskii, M. Yu. Khachai
Avtomat. i Telemekh., 2012, no. 2,  3–4

Presentations in Math-Net.Ru
1. Достижимая гарантия качества кластеризации методом k-медиан на отрезке [0,1]
M. Yu. Khachay
Seminar for Optimization Laboratory
October 13, 2017 12:00
2. Квазипирамидальные маршруты для обобщенной задачи коммивояжера
M. Yu. Khachay
Seminar for Optimization Laboratory
October 13, 2017 11:00
3. Аппроксимируемость задачи маршрутизации и близких задач в классе детерминированных алгоритмов
M. Yu. Khachay
Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT)
April 28, 2017 18:30   
4. Эффективные алгоритмы для некоторых актуальных обобщений задачи коммивояжера
M. Yu. Khachai

June 14, 2016 11:45   
5. Approximation of the optimal routing problem for the finite-dimensional spaces
M. Yu. Khachai
Seminar of Control System Department
June 2, 2016 12:00
6. Точный алгоритм с линейной трудоемкостью для одной задачи обхода мегаполисов
M. Yu. Khachai
Seminar for Optimization Laboratory
February 12, 2016 11:00
7. Методология решения комбинаторных задач о наименьшей системе представителей и родственных задач
M. Yu. Khachai
Seminar for Optimization Laboratory
November 6, 2015 11:00
8. Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem
M. Yu. Khachai
Seminar for Optimization Laboratory
October 30, 2015 11:00
9. Новые результаты в комбинаторной оптимизации типа задачи коммивояжера
M. Yu. Khachai
PreMoLab Seminar
October 15, 2014 17:00
10. Polynomial-time approximation scheme for problem of splitting complete Euclidean graph on two minimum weight gamiltonian cycles
M. Yu. Khachai, Neznakhina E.D.
Seminar for Optimization Laboratory
April 18, 2014 11:00

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018