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

  1. 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence

    Kel’manov, A., Khamidullin, S. & Panasenko, A., 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. 386-393 8 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

  2. A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand

    Kononov, A. V., Panin, A. A. & Plyasunov, A. V., 1 Jul 2019, In: Journal of Applied and Industrial Mathematics. 13, 3, p. 500-510 11 p.

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

  3. A formalization of document models with semantic modelling

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2019, In: Bulletin of Irkutsk State University, Series Mathematics. 27, p. 36-54 19 p.

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

  4. A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

    van Bevern, R. & Slugina, V. A., Nov 2020, In: Historia Mathematica. 53, p. 118-127 10 p.

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

  5. A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

    Kononova, P. A. & Kochetov, Y. A., 1 Apr 2019, In: Journal of Applied and Industrial Mathematics. 13, 2, p. 239-249 11 p.

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

  6. A lower bound on the size of the largest metrically regular subset of the Boolean cube

    Oblaukhov, A., 15 Jul 2019, In: Cryptography and Communications. 11, 4, p. 777-791 15 p.

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

  7. An Accelerated Exact Algorithm for the One-Dimensional M-Variance Problem

    Kel’manov, A. V. & Ruzankin, P. S., 1 Oct 2019, In: Pattern Recognition and Image Analysis. 29, 4, p. 573-576 4 p.

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

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

  9. An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution

    Gimadi, E. K. & Tsidulko, O. Y., 1 Jul 2017, In: Journal of Applied and Industrial Mathematics. 11, 3, p. 354-361 8 p.

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

  10. An Exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 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. 131-143 13 p. (Communications in Computer and Information Science; vol. 974).

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

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

ID: 3087360