Persons: Khachay, Mikhail Yurevich

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Khachay, Mikhail Yurevich

Statistics Math-Net.Ru
Total publications:	29
Scientific articles:	26
Presentations:	13

Number of views:
This page:	4341
Abstract pages:	6728
Full texts:	1995
References:	826

Professor of Russian Academy of Sciences

Senior Researcher

Doctor of physico-mathematical sciences

E-mail:

http://www.mathnet.ru/eng/person28087

https://scholar.google.com/citations?user=uWkMwbQAAAAJ&hl=en

https://zbmath.org/authors/?q=ai:khachai.m-yu

https://mathscinet.ams.org/mathscinet/MRAuthorID/627744

https://elibrary.ru/author_items.asp?spin=9243-1470

http://orcid.org/0000-0003-3555-0080

http://www.researcherid.com/rid/H-3251-2013

https://www.scopus.com/authid/detail.url?authorId=6507117765

https://www.researchgate.net/profile/Michael_Khachay

Publications in Math-Net.Ru

	2019
1.	M. Yu. Khachay, Yu. Yu. Ogorodnikov, “Haimovich-Rinnooy Kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:4 (2019), 235–248
	2018
2.	M. Yu. Khachay, Yu. Yu. Ogorodnikov, “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
	2017
3.	M. Yu. Khachai, D. M. Khachai, V. S. Pankratov, “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
4.	M. Yu. Khachay, E. D. Neznakhina, “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
	2016
5.	M. Yu. Khachai, E. D. Neznakhina, “Approximation Schemes for the Generalized Traveling Salesman Problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016), 283–292 ; Proc. Steklov Inst. Math. (Suppl.), 299, suppl. 1 (2017), 97–105
6.	M. Yu. Khachai, R. D. Dubinin, “Approximability of the optimal routing problem in finite-dimensional Euclidean spaces”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:2 (2016), 292–303 ; Proc. Steklov Inst. Math. (Suppl.), 297, suppl. 1 (2017), 117–128
7.	Daniel M. Khachai, Michael Yu. Khachay, “On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line”, Ural Math. J., 2:2 (2016), 117–126
	2015
8.	A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai, “An exact algorithm with linear complexity for a problem of visiting megalopolises”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015), 309–317 ; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 38–46
	2014
9.	M. Yu. Khachai, M. I. Poberii, “Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms”, Avtomat. i Telemekh., 2014, 4, 81–93 ; Autom. Remote Control, 75:4 (2014), 657–667
10.	M. Yu. Khachai, E. D. Neznakhina, “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 ; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 111–125
11.	E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “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 ; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 88–101
	2013
12.	Vl. D. Mazurov, M. Yu. Khachai, “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
13.	I. I. Eremin, E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “$2$-approximate algorithm for finding a clique with minimum weight of vertices and edges”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013), 134–143 ; Proc. Steklov Inst. Math. (Suppl.), 284, suppl. 1 (2014), 87–95
	2012
14.	E. G. Pytkeev, M. Yu. Khachai, “Topological properties of measurable structures and sufficient conditions for uniform convergence of frequencies to probabilities”, Avtomat. i Telemekh., 2012, 2, 89–98 ; Autom. Remote Control, 73:2 (2012), 291–299
15.	M. Yu. Khachai, M. I. Poberii, “The computational complexity and approximability of a series of geometric covering problems”, Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012), 247–260 ; Proc. Steklov Inst. Math. (Suppl.), 283, suppl. 1 (2013), 64–77
	2010
16.	M. Yu. Khachai, “Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules”, Avtomat. i Telemekh., 2010, 3, 178–189 ; Autom. Remote Control, 71:3 (2010), 528–539
17.	M. Yu. Khachai, “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 ; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S46–S54
18.	E. G. Pytkeev, M. Yu. Khachai, “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 ; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S138–S151
	2008
19.	V. D. Mazurov, M. Yu. Khachai, M. I. Poberii, “Combinatorial optimization problems related to the committee polyhedral separability of finite sets”, Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008), 89–102 ; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S93–S107
	2007
20.	V. D. Mazurov, M. Yu. Khachai, “Parallel computations and committee constructions”, Avtomat. i Telemekh., 2007, 5, 182–192 ; Autom. Remote Control, 68:5 (2007), 912–921
	2004
21.	V. D. Mazurov, M. Yu. Khachai, “Committees of systems of linear inequalities”, Avtomat. i Telemekh., 2004, 2, 43–54 ; Autom. Remote Control, 65:2 (2004), 193–203
	2003
22.	V. D. Mazurov, M. Yu. Khachai, “Committee constructions as a generalization of contradictory problems of operations research”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003), 56–66
	2002
23.	V. D. Mazurov, M. Yu. Khachai, A. I. Rybin, “Committee constructions for solving problems of selection, diagnostics, and prediction”, Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002), 66–102 ; Proc. Steklov Inst. Math. (Suppl.), 2002no. , suppl. 1, S67–S101
24.	M. Yu. Khachai, “A game against nature associated with majority-vote decision making”, Zh. Vychisl. Mat. Mat. Fiz., 42:10 (2002), 1609–1616 ; Comput. Math. Math. Phys., 42:10 (2002), 1547–1554
	1997
25.	M. Yu. Khachai, “On the existence of a majority committee”, Diskr. Mat., 9:3 (1997), 82–95 ; Discrete Math. Appl., 7:4 (1997), 383–397
26.	M. Yu. Khachaĭ, “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 ; Comput. Math. Math. Phys., 37:11 (1997), 1356–1361

	2014
27.	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, “Ivan Ivanovich Eremin”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014), 5–12 ; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 1–8
28.	Yu. G. Evtushenko, M. Yu. Khachai, “In memory of Ivan Ivanovich Eryomin (22.01.1933–21.07.2013)”, Zh. Vychisl. Mat. Mat. Fiz., 54:5 (2014), 887–891
	2012
29.	A. I. Kibzun, E. A. Nurminskii, M. Yu. Khachai, “Mathematical Programming: State of the Art”, Avtomat. i Telemekh., 2012, 2, 3–4

Presentations in Math-Net.Ru

1.	Адаптивный эвристический солвер для обобщенной задачи коммивояжера с ограничениями предшествования M. Yu. Khachay, Kudryavtsev A.V., A. A. Petunin Seminar for Optimization Laboratory October 23, 2020 11:00
2.	Эффективная аппроксимируемость задачи маршрутизации транспорта в метрических пространствах фиксированной размерности удвоения M. Yu. Khachay Seminar for Optimization Laboratory February 14, 2020 11:00
3.	Эффективные алгоритмы с гарантированными оценками для маршрутных задач комбинаторной оптимизации M. Yu. Khachay IX Internet video conference "Day of Mathematics and Mechanics" September 9, 2019 11:40
4.	Достижимая гарантия качества кластеризации методом k-медиан на отрезке [0,1] M. Yu. Khachay Seminar for Optimization Laboratory October 13, 2017 12:00
5.	Квазипирамидальные маршруты для обобщенной задачи коммивояжера M. Yu. Khachay Seminar for Optimization Laboratory October 13, 2017 11:00
6.	Аппроксимируемость задачи маршрутизации и близких задач в классе детерминированных алгоритмов M. Yu. Khachay Mathematical Workshop of the School of Applied Mathematics and Computer Science (MIPT) April 28, 2017 18:30
7.	Эффективные алгоритмы для некоторых актуальных обобщений задачи коммивояжера M. Yu. Khachai Conference of Professors of the RAS in the Department of Mathematical Sciences of the Russian Academy of Sciences June 14, 2016 11:45
8.	Approximation of the optimal routing problem for the finite-dimensional spaces M. Yu. Khachai Seminar of Control System Department June 2, 2016 12:00
9.	Точный алгоритм с линейной трудоемкостью для одной задачи обхода мегаполисов M. Yu. Khachai Seminar for Optimization Laboratory February 12, 2016 11:00
10.	Методология решения комбинаторных задач о наименьшей системе представителей и родственных задач M. Yu. Khachai Seminar for Optimization Laboratory November 6, 2015 11:00
11.	Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem M. Yu. Khachai Seminar for Optimization Laboratory October 30, 2015 11:00
12.	Новые результаты в комбинаторной оптимизации типа задачи коммивояжера M. Yu. Khachai PreMoLab Seminar October 15, 2014 17:00
13.	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

Registration

Logotypes