1. 2023
  2. Approximation Algorithms with Constant Factors for a Series of Asymmetric Routing Problems

    Neznakhina, E., Ogorodnikov, Y., Rizhenko, K. V. & Khachay, M., 2023, In: Doklady Mathematics. 108, 3, p. 499-505 7 p.

    Research output: Contribution to journalArticlepeer-review

  3. ПРИБЛИЖЕННЫЕ АЛГОРИТМЫ С ФИКСИРОВАННЫМИ ОЦЕНКАМИ ТОЧНОСТИ ДЛЯ СЕРИИ АСИММЕТРИЧНЫХ ЗАДАЧ МАРШРУТИЗАЦИИ

    Незнахина, Е. Д., Огородников, Ю. Ю., Рыженко, К. В. & Хачай, М. Ю., 2023, In: Доклады Российской академии наук. Математика, информатика, процессы управления. 514, 1, p. 89-97 9 p.

    Research output: Contribution to journalArticlepeer-review

  4. 2022
  5. A Problem-Specific Branch-and-Bound Algorithm for the Protected Shortest Simple Path Problem with Must-Pass Nodes

    Ogorodnikov, Y., Rudakov, R., Khachai, D. & Khachay, M., 1 Jan 2022, In: IFAC-PapersOnLine. 55, 10, p. 572-577 6 p.

    Research output: Contribution to journalArticlepeer-review

  6. 2021
  7. Efficient approximation of the metric CVRP in spaces of fixed doubling dimension

    Khachay, M., Ogorodnikov, Y. & Khachay, D., Jul 2021, In: Journal of Global Optimization. 80, 3, p. 679-710 32 p.

    Research output: Contribution to journalArticlepeer-review

  8. 2020
  9. Efficient Approximation of the Capacitated Vehicle Routing Problem in a Metric Space of an Arbitrary Fixed Doubling Dimension

    Khachay, M. Y. & Ogorodnikov, Y. Y., 1 Jul 2020, In: Doklady Mathematics. 102, 1, p. 324-329 6 p.

    Research output: Contribution to journalArticlepeer-review

  10. An Extension of the Das and Mathieu QPTAS to the Case of Polylog Capacity Constrained CVRP in Metric Spaces of a Fixed Doubling Dimension

    Khachay, M., Ogorodnikov, Y. & Khachay, D., 1 Jan 2020, Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Proceedings. Kononov, A., Khachay, M., Kalyagin, V. A. & Pardalos, P. (eds.). Springer Verlag, p. 49-68 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12095 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  11. Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand

    Khachay, M. & Ogorodnikov, Y., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer, Vol. 1145. p. 415-426 12 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  12. PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows

    Khachay, M. & Ogorodnikov, Y., 1 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Verlag, Vol. 11968. p. 224-230 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11968 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  13. Qptas for the cvrp with a moderate number of routes in a metric space of any fixed doubling dimension

    Khachay, M. & Ogorodnikov, Y., 1 Jan 2020, Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers. Kotsireas, I. S. & Pardalos, P. M. (eds.). Springer, p. 27-32 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12096 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Previous 1 2 Next

ID: 7875670