61 - 70 out of 94Page size: 10
  1. 2016

  2. 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., 2016, In: Ifac papersonline. 49, 12, p. 6-10 5 p.

    Research output: Contribution to journal › Article › peer-review

  3. PTAS for the euclidean capacitated vehicle routing problem in Rd

    Khachay, M. & Dubinin, R., 2016, Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E. & Pardalos, P. (eds.). Springer, Vol. 9869 LNCS. p. 193-205 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9869 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  4. The cropland capture game: Good annotators versus vote aggregation methods

    Baklanov, A., Fritz, S., Khachay, M., Nurmukhametov, O. & See, L., 2016, Advances in Intelligent Systems and Computing. Springer Verlag, Vol. 453. p. 167-180 14 p. (Advances in Intelligent Systems and Computing; vol. 453).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  5. Towards a Fixed Parameter Tractability of Geometric Hitting Set Problem for Axis-Parallel Squares Intersecting a Given Straight Line

    Khachay, D., Khachay, M. & Poberiy, M., 2016, INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE: TECHNIQUES AND APPLICATIONS, AITA 2016. DEStech Publications, Inc., p. 226-230 5 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  6. АППРОКСИМИРУЕМОСТЬ ЗАДАЧИ ОБ ОПТИМАЛЬНОЙ МАРШРУТИЗАЦИИ ТРАНСПОРТА В КОНЕЧНОМЕРНЫХ ЕВКЛИДОВЫХ ПРОСТРАНСТВАХ

    Хачай, М. Ю. & Дубинин, Р. Д., 2016, In: Труды института математики и механики УрО РАН. 22, 2, p. 292-303 12 p.

    Research output: Contribution to journal › Article › peer-review

  7. ПРИБЛИЖЕННЫЕ СХЕМЫ ДЛЯ ОБОБЩЕННОЙ ЗАДАЧИ КОММИВОЯЖЕРА

    Хачай, М. Ю. & Незнахина, Е. Д., 2016, In: Труды института математики и механики УрО РАН. 22, 3, p. 283-292 10 p.

    Research output: Contribution to journal › Article › peer-review

  8. 2015

  9. Committee polyhedral separability: complexity and polynomial approximation

    Khachay, M., Oct 2015, In: Machine Learning. 101, 1-3, p. 231-251 21 p.

    Research output: Contribution to journal › Article › peer-review

  10. A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph

    Khachai, M. Y. & Neznakhina, E. D., Jul 2015, In: Proceedings of the Steklov Institute of Mathematics. 289, p. 111-125 15 p.

    Research output: Contribution to journal › Article › peer-review

  11. 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., Jul 2015, In: Proceedings of the Steklov Institute of Mathematics. 289, p. 88-101 14 p.

    Research output: Contribution to journal › Article › peer-review

  12. Approximability of the problem about a minimum-weight cycle cover of a graph

    Khachai, M. Y. & Neznakhina, E. D., Mar 2015, In: Doklady Mathematics. 91, 2, p. 240-245 6 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1...3 4 5 6 7 8 9 10 Next

ID: 62495