JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
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:
email
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 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]$ 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 Trudy Inst. Mat. i Mekh. UrO RAN , 23 :3 (2017), 280–291
4.
Approximation Schemes for the Generalized Traveling Salesman Problem Trudy Inst. Mat. i Mekh. UrO RAN , 22 :3 (2016), 283–292
5.
Approximability of the optimal routing problem in finite-dimensional Euclidean spaces 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 Ural Math. J. , 2 :2 (2016), 117–126
7.
An exact algorithm with linear complexity for a problem of visiting megalopolises 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 Avtomat. i Telemekh. , 2014, no. 4, 81–93
9.
Polynomial-time approximation scheme for a Euclidean problem on a cycle covering of a graph 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 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 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 edgesTrudy 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 Avtomat. i Telemekh. , 2012, no. 2, 89–98
14.
The computational complexity and approximability of a series of geometric covering problems 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 Avtomat. i Telemekh. , 2010, no. 3, 178–189
16.
Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning 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 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 Trudy Inst. Mat. i Mekh. UrO RAN , 14 :2 (2008), 89–102
19.
Parallel computations and committee constructions Avtomat. i Telemekh. , 2007, no. 5, 182–192
20.
Committees of systems of linear inequalities Avtomat. i Telemekh. , 2004, no. 2, 43–54
21.
Committee constructions as a generalization of contradictory problems of operations research Diskretn. Anal. Issled. Oper., Ser. 2 , 10 :2 (2003), 56–66
22.
Committee constructions for solving problems of selection, diagnostics, and prediction Trudy Inst. Mat. i Mekh. UrO RAN , 8 :1 (2002), 66–102
23.
A game against nature associated with majority-vote decision making Zh. Vychisl. Mat. Mat. Fiz. , 42 :10 (2002), 1609–1616
24.
On the existence of a majority committee Diskr. Mat. , 9 :3 (1997), 82–95
25.
Estimate of the number of members in the minimal committee of a system of linear inequalities Zh. Vychisl. Mat. Mat. Fiz. , 37 :11 (1997), 1399–1404
26.
Ivan Ivanovich Eremin 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) Zh. Vychisl. Mat. Mat. Fiz. , 54 :5 (2014), 887–891
28.
Mathematical Programming: State of the Art Avtomat. i Telemekh. , 2012, no. 2, 3–4
Presentations in Math-Net.Ru
1.
Достижимая гарантия качества кластеризации методом k-медиан на отрезке [0,1] Seminar for Optimization Laboratory October 13, 2017
2.
Квазипирамидальные маршруты для обобщенной задачи коммивояжера Seminar for Optimization Laboratory October 13, 2017
3.
Аппроксимируемость задачи маршрутизации и близких задач в классе детерминированных алгоритмов Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT) April 28, 2017
4.
Эффективные алгоритмы для некоторых актуальных обобщений задачи коммивояжера June 14, 2016
5.
Approximation of the optimal routing problem for the finite-dimensional spaces Seminar of Control System Department June 2, 2016
6.
Точный алгоритм с линейной трудоемкостью для одной задачи обхода мегаполисов Seminar for Optimization Laboratory February 12, 2016
7.
Методология решения комбинаторных задач о наименьшей системе представителей и родственных задач Seminar for Optimization Laboratory November 6, 2015
8.
Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem Seminar for Optimization Laboratory October 30, 2015
9.
Новые результаты в комбинаторной оптимизации типа задачи коммивояжера 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 Seminar for Optimization Laboratory April 18, 2014
Organisations
Terms of Use