| Нет данных |
| — |
— |
APPROXIMABILITY OF THE D-DIMENSIONAL EUCLIDEAN CAPACITATED VEHICLE ROUTING PROBLEM / Khachay M.,Dubinin R. // . - 2016. - V. , l. . - P. 050002. |
2016 |
0 |
| Journal of Global Optimization |
— |
APPROXIMABILITY OF THE MINIMUM-WEIGHT K-SIZE CYCLE COVER PROBLEM / Khachay M.,Neznakhina K. // Journal of Global Optimization. - 2016. - V. 66, l. 1. - P. 65-82. |
2016 |
0 |
| IFAC-PapersOnLine (см. в книгах) |
— |
LINEAR TIME ALGORITHM FOR PRECEDENCE CONSTRAINED ASYMMETRIC GENERALIZED TRAVELING SALESMAN PROBLEM / Chentsov A.,Khachay M.,Khachay D. // IFAC-PapersOnLine (см. в книгах). - 2016. - V. 49, l. 12. - P. 651-655. |
2016 |
1 |
| Ural Mathematical Journal |
— |
ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS-PARALLEL SQUARES INTERSECTING A STRAIGHT LINE / Khachay D.M.,Khachay M.Yu. // Ural Mathematical Journal. - 2016. - V. 2, l. 2 (3). - P. 117-126. |
2016 |
0 |
| IFAC-PapersOnLine |
— |
POLYNOMIAL TIME APPROXIMATION SCHEME FOR THE MINIMUM-WEIGHT K-SIZE CYCLE COVER PROBLEM IN EUCLIDEAN SPACE OF AN ARBITRARY FIXED DIMENSION / Khachay M.,Neznakhina K. // IFAC-PapersOnLine. - 2016. - V. 49, l. 12. - P. 6-10. |
2016 |
0 |
| Lecture Notes in Computer Science |
— |
PREFACE / Kochetov Y.,Khachay M.,Beresnev V.,Nurminski E.,Pardalos P. // Lecture Notes in Computer Science. - 2016. - V. 9869 LNCS, l. . |
2016 |
0 |
| Lecture Notes in Computer Science |
— |
PTAS FOR THE EUCLIDEAN CAPACITATED VEHICLE ROUTING PROBLEM IN RD / Khachay M.,Dubinin R. // Lecture Notes in Computer Science. - 2016. - V. 9869 LNCS, l. . - P. 193-205. |
2016 |
0 |
| Advances in Intelligent Systems and Computing |
— |
THE CROPLAND CAPTURE GAME: GOOD ANNOTATORS VERSUS VOTE AGGREGATION METHODS / Baklanov A.,Fritz S.,See L.,Khachay M.,Nurmukhametov O. // Advances in Intelligent Systems and Computing. - 2016. - V. 453, l. . - P. 167-180. |
2016 |
0 |
| — |
— |
TOWARDS A PTAS FOR THE GENERALIZED TSP IN GRID CLUSTERS / Khachay M.,Neznakhina K. // . - 2016. - V. , l. . - P. 050003. |
2016 |
0 |
| Труды института математики и механики УрО РАН |
— |
АППРОКСИМИРУЕМОСТЬ ЗАДАЧИ ОБ ОПТИМАЛЬНОЙ МАРШРУТИЗАЦИИ ТРАНСПОРТА В КОНЕЧНОМЕРНЫХ ЕВКЛИДОВЫХ ПРОСТРАНСТВАХ / Хачай М.Ю.,Дубинин Р.Д. // Труды института математики и механики УрО РАН. - 2016. - V. 22, l. 2. - P. 292-303. |
2016 |
0 |