1. Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances

    Gimadi, E. K., Goncharov, E. N. & Shtepa, A. A., 2021, Analysis of Images, Social Networks and Texts - 9th International Conference, AIST 2020, Revised Selected Papers. van der Aalst, W. M., Batagelj, V., Ignatov, D. I., Khachay, M., Koltsova, O., Kutuzov, A., Kuznetsov, S. O., Lomazova, I. A., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, P. M., Pelillo, M., Savchenko, A. V. & Tutubalina, E. (eds.). Springer, p. 407-420 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12602 LNCS).

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

  2. Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph

    Gimadi, E., Shtepa, A. & Tsidulko, O., Aug 2019, 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019. Institute of Electrical and Electronics Engineers Inc., p. 53-57 5 p. 8880248. (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019).

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

  3. Implementation of asymptotically optimal approach to solving some hard combinatorial problems

    Gimadi, E. K., 2017, In: CEUR Workshop Proceedings. 1987, p. 201-208 8 p.

    Research output: Contribution to journalArticlepeer-review

  4. How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs

    Ageev, A., Gimadi, E. & Shtepa, A., 2022, Analysis of Images, Social Networks and Texts - 10th International Conference, AIST 2021, Revised Selected Papers. Burnaev, E., Ivanov, S., Panchenko, A., Ignatov, D. I., Kuznetsov, S. O., Khachay, M., Koltsova, O., Kutuzov, A., Loukachevitch, N., Napoli, A., Pardalos, P. M., Saramäki, J., Savchenko, A. V., Tsymbalov, E. & Tutubalina, E. (eds.). Springer, p. 303-314 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13217 LNCS).

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

  5. Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Input Data

    Gimadi, E., Shevyakov, A. & Shin, E., Aug 2019, 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019. Institute of Electrical and Electronics Engineers Inc., p. 48-52 5 p. 8880223. (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019).

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

  6. Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs

    Gimadi, E. K. & Tsidulko, O., 22 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Gabler, p. 201-207 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 contributionResearchpeer-review

  7. Asymptotically optimal algorithm for the maximum M-peripatetic salesman problem in a normed space

    Gimadi, E. K. & Tsidulko, O. Y., 1 Jan 2019, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer, p. 402-410 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11353 LNCS).

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

  8. 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, 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

  9. An exact polynomial algorithm for the outerplanar facility location problem with improved time complexity

    Gimadi, E., 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, p. 295-303 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

  10. An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network

    Gimadi, E. K. & Shevyakov, A. S., 2021, Recent Trends in Analysis of Images, Social Networks and Texts - 9th International Conference, AIST 2020, Revised Supplementary Proceedings. van der Aalst, W. M., Batagelj, V., Buzmakov, A., Ignatov, D. I., Kalenkova, A., Khachay, M., Koltsova, O., Kutuzov, A., Kuznetsov, S. O., Lomazova, I. A., Loukachevitch, N., Makarov, I., Napoli, A., Panchenko, A., Pardalos, P. M., Pelillo, M., Savchenko, A. V. & Tutubalina, E. (eds.). Springer, p. 267-274 8 p. (Communications in Computer and Information Science; vol. 1357 CCIS).

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

ID: 3456269