1. Approximation of the competitive facility location problem with MIPs

    Beresnev, V. & Melnikov, A., 1 Apr 2019, In: Computers and Operations Research. 104, p. 139-148 10 p.

    Research output: Contribution to journalArticlepeer-review

  2. Approximation algorithms for the maximum m-peripatetic salesman problem

    Gimadi, E. K. & Tsidulko, O. Y., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. VanDerAalst, WMP., Ignatov, DI., Khachay, M., Kuznetsov, SO., Lempitsky, Lomazova, IA., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, PM., Savchenko, AV. & Wasserman, S. (eds.). Springer-Verlag GmbH and Co. KG, p. 304-312 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10716 LNCS).

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

  3. Approximation algorithm for the problem of partitioning a sequence into clusters

    Kel’manov, A. V., Mikhailova, L. V., Khamidullin, S. A. & Khandeev, V. I., 1 Aug 2017, In: Computational Mathematics and Mathematical Physics. 57, 8, p. 1376-1383 8 p.

    Research output: Contribution to journalArticlepeer-review

  4. Approximation algorithm for a quadratic euclidean problem of searching a subset with the largest cardinality

    Ageev, A. A., Kel'Manov, A. V., Pyatkin, A. V., Khamidullin, S. A. & Shenmaier, V. V., 1 Jan 2017, In: CEUR Workshop Proceedings. 1987, p. 19-23 5 p.

    Research output: Contribution to journalConference articlepeer-review

  5. Approximability and inapproximability for maximum k-edge-colored clustering problem

    Alhamdan, Y. M. & Kononov, A., 1 Jan 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. van Bevern, R. & Kucherov, G. (eds.). Springer-Verlag GmbH and Co. KG, p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

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

  6. Application of SAT-Solvers to the Problem of Finding Vectorial Boolean Functions with Required Cryptographic Properties

    Doronin, A. E. & Kalgin, K. V., 2022, In: Journal of Applied and Industrial Mathematics. 16, 4, p. 632-644 13 p.

    Research output: Contribution to journalArticlepeer-review

  7. A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem

    Erzin, A., Melidi, G., Nazarenko, S. & Plotnikov, R., 2021, Advances in Optimization and Applications - 12th International Conference, OPTIMA 2021, Revised Selected Papers. Olenev, N. N., Evtushenko, Y. G., Malkova, V., Jacimovic, M. & Khachay, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 201-216 16 p. (Communications in Computer and Information Science; vol. 1514 CCIS).

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

  8. A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements

    Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I., Pyatkin, A. V., Shamardin, Y. V. & Shenmaier, V. V., 1 Jul 2018, In: Pattern Recognition and Image Analysis. 28, 3, p. 363-370 8 p.

    Research output: Contribution to journalArticlepeer-review

  9. A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes

    Chernykh, I., Kononov, A. & Sevastyanov, S., 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 Gabler, p. 301-312 12 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 contributionResearchpeer-review

  10. A Polynomial Algorithm with Asymptotic Ratio 2/3 for the Asymmetric Maximization Version of the m-PSP

    Glebov, A. N. & Toktokhoeva, S. G., 1 Aug 2020, In: Journal of Applied and Industrial Mathematics. 14, 3, p. 456-469 14 p.

    Research output: Contribution to journalArticlepeer-review

ID: 3086997