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

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

    van Bevern, R., 29 Dec 2020, Новосибирский государственный университет, Patent No. 38, Priority date 28 Dec 2020

    Research output: Patent › Know-how registration

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

    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

  3. Модели и методы оптимизации беспроводных сенсорных сетей

    Ерзин, А. И., 2018, Издательский центр Института информационных и вычислительных технологий (ТОО «ИИВТ»). 263 p.

    Research output: Book/Report › Book › Research › peer-review

  4. VNDS for the min-power symmetric connectivity problem

    Plotnikov, R., Erzin, A. & Mladenovic, N., 1 Nov 2019, In: Optimization Letters. 13, 8, p. 1897-1911 15 p.

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

  5. Towards semantic document modelling of business processes

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2019, In: Bulletin of Irkutsk State University, Series Mathematics. 29, p. 52-67 16 p.

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

  6. The Variable Neighborhood Search for a Consistent Vehicle Routing Problem under the Shift Length Constraints

    Kulachenko, I. N., Kononova, P. A., Kochetov, Y. A. & Kurochkin, A. A., Sept 2019, In: Ifac papersonline. 52, 13, p. 2314-2319 6 p.

    Research output: Contribution to journal › Conference article › peer-review

  7. The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

    Kel’manov, A. & Khandeev, V., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Bykadorov, I., Strusevich, V. & Tchemisova, T. (eds.). Springer International Publishing AG, p. 207-216 10 p. (Communications in Computer and Information Science; vol. 1090 CCIS).

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

  8. The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

    van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M. & Suchý, O., 1 Nov 2018, In: Discrete Optimization. 30, p. 20-50 31 p.

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

  9. 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

  10. The Fifth International Students' Olympiad in cryptography - NSUCRYPTO: Problems and their solutions

    Gorodilova, A., Agievich, S., Carlet, C., Hou, X., Idrisova, V., Kolomeec, N., Kutsenko, A., Mariot, L., Oblaukhov, A., Picek, S., Preneel, B., Rosie, R. & Tokareva, N., 3 May 2020, In: Cryptologia. 44, 3, p. 223-256 25 p.

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

Previous 1 2 3 4 5 6 7 8 ...11 Next

ID: 3087360