271 - 280 out of 371Page size: 10
Sort by: Title

  1. Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets

    Khandeev, V. & Neshchadim, S., 20 Dec 2024, Communications in Computer and Information Science. Springer, p. 319-333 15 p. 22. (Communications in Computer and Information Science; vol. 2239 CCIS).

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

  2. Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets

    Galashov, A. E. & Kel’manov, A. V., 1 Jan 2017, In: Numerical Analysis and Applications. 10, 1, p. 11-16 6 p.

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

  3. Public-private partnership models with tax incentives: Numerical analysis of solutions

    Lavlinskii, S., Panin, A. A. & Plyasunov, A. V., 1 Jan 2018, Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer, p. 220-234 15 p. (Communications in Computer and Information Science; vol. 871).

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

  4. Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with constraints on the size of the clusters: Complexity and approximability

    Kel'manov, A. V. E., Pyatkin, A. V. E. & Khandeev, V. I. I., 1 Jan 2019, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 25, 4, p. 69-78 10 p.

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

  5. Randomized algorithms for some clustering problems

    Kel’manov, A., Khandeev, V. & Panasenko, A., 1 Jan 2018, Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer, p. 109-119 11 p. (Communications in Computer and Information Science; vol. 871).

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

  6. Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space

    Kel’manov, A. V., Panasenko, A. V. & Khandeev, V. I., 1 May 2019, In: Computational Mathematics and Mathematical Physics. 59, 5, p. 842-850 9 p.

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

  7. Randomized algorithms for some sequence clustering problems

    Khamidullin, S., Khandeev, V. & Panasenko, A., 1 Jun 2020, Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers. Kotsireas, I. S. & Pardalos, P. M. (eds.). Springer Gabler, p. 96-101 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 proceeding › Conference contribution › Research › peer-review

  8. Randomized Greedy Strategy with Corner Filling for the Irregular 2D Bin Packing Problem

    Shperling, S. & Kochetov, Y., 20 Dec 2024, Communications in Computer and Information Science. Springer, p. 250-263 14 p. 17. (Communications in Computer and Information Science; vol. 2239 CCIS).

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

  9. Rayleigh quotients of Dillon’s functions

    Gangopadhyay, A. K., Gangopadhyay, S., Goyal, M., Kutsenko, A. & Mandal, B., 2025, In: Quaestiones Mathematicae. p. 1-15 15 p.

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

  10. Recognition of a Quasi-Periodic Sequence Containing an Unknown Number of Nonlinearly Extended Reference Subsequences

    Kel’manov, A. V., Mikhailova, L. V., Ruzankin, P. S. & Khamidullin, S. A., Jul 2021, In: Computational Mathematics and Mathematical Physics. 61, 7, p. 1153-1161 9 p.

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

Previous 1...24 25 26 27 28 29 30 31 ...38 Next

ID: 3086997