Exact algorithms for two quadratic euclidean problems of searching for the largest subset and longest subsequence

Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, p. 326-336 11 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 proceeding › Conference contribution › Research › peer-review

Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case

Kel’manov, A. & Khandeev, V., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 394-399 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).

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

Facility location in unfair competition

Beresnev, V. & Melnikov, A., 2016, Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. Khachay, M., Pardalos, P., Kochetov, Y., Beresnev, V. & Nurminski, E. (eds.). Springer-Verlag GmbH and Co. KG, p. 325-335 11 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 › Research › peer-review

Fast and exact algorithms for some NP-hard 2-clustering problems in the one-dimensional case

Kel’manov, A. & Khandeev, V., 1 Jan 2019, Analysis of Images, Social Networks and Texts - 8th International Conference, AIST 2019, Revised Selected Papers. van der Aalst, W. M. P., Batagelj, V., Ignatov, D. I., Kuskova, V., Kuznetsov, S. O., Lomazova, I. A., Khachay, M., Kutuzov, A., Loukachevitch, N., Napoli, A., Pardalos, P. M., Pelillo, M., Savchenko, A. V. & Tutubalina, E. (eds.). Springer International Publishing AG, p. 377-387 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11832 LNCS).

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

Finding secluded places of special interest in graphs

Van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M. & Suchý, O., 1 Feb 2017, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 63. 5

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

Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks

Plotnikov, R., Erzin, A. & Zalyubovskiy, V., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer-Verlag GmbH and Co. KG, p. 216-231 16 p. (Communications in Computer and Information Science; vol. 974).

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

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 Science and Business Media Deutschland GmbH, 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 proceeding › Conference contribution › Research › peer-review

How the difference in travel times affects the optima localization for the routing open shop

Chernykh, I. & Lgotina, E., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Khachay, M., Pardalos, P. & Kochetov, Y. (eds.). Springer-Verlag GmbH and Co. KG, p. 187-201 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11548 LNCS).

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

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 proceeding › Conference contribution › Research › peer-review

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop

Chernykh, I. & Pyatkin, A., 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. 106-120 15 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 proceeding › Conference contribution › Research › peer-review