Kolpakov Roman Maksimovich

Publications in Math-Net.Ru

1. Aleksandr Borisovich Ugol'nikov (04.12.1951–19.07.2013)
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 6,  58–62
2. Optimal strategy for solving a special case of the knapsack problem by the branch and bound method
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 3,  13–22
3. Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
   
   Diskr. Mat., 31:4 (2019),  20–37
4. Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering
   
   Avtomat. i Telemekh., 2017, no. 3,  96–110
5. On the best choice of a branching variable in the subset sum problem
   
   Diskr. Mat., 29:1 (2017),  51–58
6. Indexing and querying character sets in one- and two-dimensional words
   
   Fundam. Prikl. Mat., 20:6 (2015),  3–16
7. On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
   
   Avtomat. i Telemekh., 2010, no. 10,  156–166
8. Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
   
   Diskr. Mat., 22:1 (2010),  58–73
9. Асимптотическая оценка сложности метода ветвей и границ с ветвлением по дробной переменной для задачи о ранце
   
   Diskretn. Anal. Issled. Oper., 15:1 (2008),  58–81
10. On an efficient method for estimating the number of nonrepeating words
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007),  70–86
11. On the number of repetition-free words
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006),  27–37
12. On multivalued transformations of finite sets of binary distributions with rational probabilities
    
    Diskr. Mat., 17:1 (2005),  102–128
13. Closed classes of finite distributions of rational probabilities
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:3 (2004),  16–31
14. A criterion for the generation of sets of rational probabilities in the class of Boolean functions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:2 (1999),  41–61
15. On upper bounds on the complexity of random number generation by probabilistic $\pi$-nets
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1995, no. 5,  99–102
16. Generation of rational numbers by probabilistic switching $\pi$-nets
    
    Diskr. Mat., 6:3 (1994),  18–38
17. Estimates for the complexity of the generation of rational numbers of probabilistic switching $\pi$-nets
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1992, no. 6,  62–65
18. On the generation of rational numbers by probabilistic switching networks
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1992, no. 5,  46–52
19. Generation of some classes of rational numbers by probabilistic $\pi$-nets
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1991, no. 2,  27–30


20. The Chair of Discrete Mathematics
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2024, no. 6,  38–49
21. 90 years since the birthday of Academician Oleg Borisovich Lupanov (02.06.1932 – 03.05.2006)
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 3,  3–5
22. Oktay Muradoviсh Kasim-Zade (29.04.1953–22.12.2020)
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 4,  60–63