41 - 43 out of 43Page size: 10
Sort by: Title

  1. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times

    van Bevern, R. A., Pyatkin, A. V. & Sevastyanov, S., 1 Jan 2019, In: Сибирские электронные математические известия. 16, p. 42-84 43 p.

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

  2. 1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation

    Pyatkin, A. V., 2023, In: Yugoslav Journal of Operations Research. 33, 1, p. 59-69 11 p.

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

  3. 1/2-Approximation polynomial-time algorithm for a problem of searching a subset

    Ageev, A., Kel'Manov, A., Pyatkin, A., Khamidullin, S. & Shenmaier, V., 14 Nov 2017, Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., p. 8-12 5 p. 8109827

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

Previous 1 2 3 4 5 Next

ID: 3437278