| Нет данных |
| Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
— |
PTAS for the euclidean capacitated vehicle routing problem in Rd / Khachay M., Dubinin R. // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 2016. - V. 9869 LNCS, l. . - P. 193-205.
|
2016 |
0 |
10.1007/978-3-319-44914-2_16
(полный текст)
|
| Advances in Intelligent Systems and Computing |
— |
The cropland capture game: Good annotators versus vote aggregation methods / Baklanov A., Fritz S., Khachay M., Nurmukhametov O., See L. // Advances in Intelligent Systems and Computing. - 2016. - V. 453, l. . - P. 167-180.
|
2016 |
0 |
10.1007/978-3-319-38884-7_13
(полный текст)
|
| AIP Conference Proceedings |
— |
Towards a PTAS for the generalized TSP in grid clusters / Khachay M., Neznakhina K. // AIP Conference Proceedings. - 2016. - V. 1776, l. .
|
2016 |
0 |
10.1063/1.4965324
(полный текст)
|
| Proceedings of the Steklov Institute of Mathematics |
— |
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph / Khachai M.Y., Neznakhina E.D. // Proceedings of the Steklov Institute of Mathematics. - 2015. - V. 289, l. . - P. 111-125.
|
2015 |
0 |
10.1134/S0081543815050107
(полный текст)
|
| Communications in Computer and Information Science |
— |
Analysis of Images, Social Networks and Texts: 4th International Conference, AIST 2015 Yekaterinburg, Russia, April 9-11, 2015 Revised Selected Papers / Khachay M.Y., Konstantinova N., Panchenko A., Ignatov D.I., Labunets V.G. // Communications in Computer and Information Science. - 2015. - V. 542, l. .
|
2015 |
0 |
10.1007/978-3-319-26123-2
(полный текст)
|
| Doklady Mathematics |
— |
Approximability of the problem about a minimum-weight cycle cover of a graph / Khachai M.Y., Neznakhina E.D. // Doklady Mathematics. - 2015. - V. 91, l. 2. - P. 240-245.
|
2015 |
0 |
10.1134/S1064562415020313
(полный текст)
|
| Machine Learning |
— |
Committee polyhedral separability: complexity and polynomial approximation / Khachay M. // Machine Learning. - 2015. - V. 101, l. 1-3. - P. 231-251.
|
2015 |
0 |
10.1007/s10994-015-5505-0
(полный текст)
|
| Proceedings of the Steklov Institute of Mathematics |
— |
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph / Gimadi E.K., Kel’manov A.V., Pyatkin A.V., Khachai M.Y. // Proceedings of the Steklov Institute of Mathematics. - 2015. - V. 289, l. . - P. 88-101.
|
2015 |
0 |
10.1134/S0081543815050089
(полный текст)
|
| International Journal of Artificial Intelligence |
— |
Integer partition problem: Theoretical approach to improving accuracy of classifier ensembles / Khachay M., Pobery M., Khachay D. // International Journal of Artificial Intelligence. - 2015. - V. 13, l. 1. - P. 135-146.
|
2015 |
0 |
— |
| Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
— |
Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem / Khachay M., Zaytseva H. // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 2015. - V. 9486, l. . - P. 178-190.
|
2015 |
0 |
10.1007/978-3-319-26626-8_14
(полный текст)
|