1 - 10 out of 18Page size: 10
Sort by: Title

  1. О некоторых эффективно разрешимых классах сетевой задачи размещения с ограничениями на пропускные способности коммуникаций

    Gimadi, E. K. & Tsidulko, O. Y., 25 May 2020, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 26, 2, p. 108-124 17 p.

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

  2. Задача размещения с ограничениями на объемы производства предприятий на графах древесного вида

    Ageev, A. A., Gimadi, E. K., Tsidulko, O. Y. & Shtepa, A. A., 2022, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 28, 2, p. 24-44 21 p., 2.

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

  3. The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable

    Afanasev, V. A., van Bevern, R. & Tsidulko, O. Y., Mar 2021, In: Operations Research Letters. 49, 2, p. 270-277 8 p.

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

  4. Representative families for matroid intersections, with applications to location, packing, and covering problems

    van Bevern, R., Tsidulko, O. Y. & Zschoche, P., 31 Jul 2021, In: Discrete Applied Mathematics. 298, p. 110-128 19 p.

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

  5. Parameterized algorithms and data reduction for the short secluded s-t-path problem

    van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., Jan 2020, In: Networks. 75, 1, p. 34-63 30 p.

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

  6. Parameterized algorithms and data reduction for safe convoy routing

    Van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., 1 Aug 2018, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 65. 10

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

  7. On Some Efficiently Solvable Classes of the Network Facility Location Problem with Constraints on the Capacities of Communication Lines

    Gimadi, E. K. & Tsidulko, O. Y., Aug 2021, In: Proceedings of the Steklov Institute of Mathematics. 313, SUPPL 1, p. S58-S72 15 p.

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

  8. On PTAS for the Geometric Maximum Connected k-Factor Problem

    Gimadi, E., Rykov, I. & Tsidulko, O., 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 Gabler, p. 194-205 12 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

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

  9. On modification of an asymptotically optimal algorithm for the maximum Euclidean traveling salesman problem

    Gimadi, E. K. & Tsidulko, O. Y., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers. Springer, p. 283-293 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11179 LNCS).

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

  10. On exact solvability of the restricted capacitated facility location problem

    Gimadi, E. K., Kurochkina, A. & Tsidulko, O., 2017, In: CEUR Workshop Proceedings. 1987, p. 209-216 8 p.

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

Previous 1 2 Next

ID: 3449376