| Publication | Date of Publication | Type |
|---|
Bicentered interval Newton operator for Robot's workspace approximation
| 2024-08-16 | Paper |
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
Journal of Global Optimization | 2024-05-17 | Paper |
Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method
Computational Mathematics and Mathematical Physics | 2024-03-04 | Paper |
Speedup estimates for some variants of the parallel implementations of the branch-and-bound method
Computational Mathematics and Mathematical Physics | 2024-03-01 | Paper |
Comparison of parallel implementations of the branch-and-bound method for shared memory systems
Journal of Computer and Systems Sciences International | 2024-01-18 | Paper |
Robot workspace approximation with modified bicentered Krawczyk method
Optimization and Applications | 2023-08-10 | Paper |
Techniques for Speeding up H-Core Protein Fitting
| 2023-04-13 | Paper |
A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees
| 2021-09-14 | Paper |
The scalability analysis of a parallel tree search algorithm
Communications in Computer and Information Science | 2021-05-18 | Paper |
Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
Applied Mathematics and Computation | 2021-03-31 | Paper |
The scalability analysis of a parallel tree search algorithm
Optimization Letters | 2021-02-17 | Paper |
Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
Discrete Mathematics and Applications | 2021-01-08 | Paper |
A deterministic algorithm for global optimization
Lecture Notes in Economics and Mathematical Systems | 2018-11-30 | Paper |
Approximating a solution set of nonlinear inequalities
Journal of Global Optimization | 2018-05-30 | Paper |
On the best choice of a branching variable in the subset sum problem
Discrete Mathematics and Applications | 2018-04-23 | Paper |
Finding sets of solutions to systems of nonlinear inequalities
Computational Mathematics and Mathematical Physics | 2017-12-06 | Paper |
Searching of gapped repeats and subrepetitions in a word
Journal of Discrete Algorithms | 2017-11-09 | Paper |
Complexity of solving the subset sum problem with the branch-and-bound method with domination and cardinality filtering
Automation and Remote Control | 2017-08-23 | Paper |
Application of optimization methods for finding equilibrium states of two-dimensional crystals
Computational Mathematics and Mathematical Physics | 2017-03-28 | Paper |
Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy
Automation and Remote Control | 2015-11-16 | Paper |
Optimization methods as applied to parametric identification of interatomic potentials
Computational Mathematics and Mathematical Physics | 2015-11-06 | Paper |
Effective hull of a set and its approximation
Doklady Mathematics | 2015-07-07 | Paper |
A deterministic algorithm for global multi-objective optimization
Optimization Methods \& Software | 2014-10-29 | Paper |
Searching of Gapped Repeats and Subrepetitions in a Word
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Method for solving constrained multicriteria optimization problems with guaranteed accuracy
Doklady Mathematics | 2014-01-24 | Paper |
Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki | 2013-07-17 | Paper |
Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem
Journal of Computer and Systems Sciences International | 2013-07-16 | Paper |
A deterministic approach to global box-constrained optimization
Optimization Letters | 2013-04-23 | Paper |
An application of the nonuniform covering method to the global optimization of mixed integer nonlinear problems
Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki | 2012-07-16 | Paper |
An asymptotic estimate for the complexity of the branch and bound method with branching with respect to a fractional variable for the knapsack problem
| 2012-02-10 | Paper |
Versions of the method of nonuniform coverings for global optimization of mixed integer nonlinear problems
Doklady Mathematics | 2012-01-17 | Paper |
Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system
Lecture Notes in Computer Science | 2011-11-23 | Paper |
On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method
Automation and Remote Control | 2011-01-03 | Paper |
Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
Discrete Mathematics and Applications | 2010-09-06 | Paper |
A combined parallel algorithm for solving the knapsack problem
Journal of Computer and Systems Sciences International | 2009-10-19 | Paper |
Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems
| 2006-05-09 | Paper |
scientific article; zbMATH DE number 2210699 (Why is no real title available?)
| 2005-09-28 | Paper |
Automated generation of strictly conforming tests based on formal specification of dynamic semantics of the programming language
Programming and Computer Software | 2005-09-05 | Paper |
A language and programming environment for high-performance parallel computing on heterogeneous networks
Programming and Computer Software | 2004-02-08 | Paper |
Refined description of the C[ language]
Programming and Computer Software | 2003-09-01 | Paper |
scientific article; zbMATH DE number 1951208 (Why is no real title available?)
| 2003-07-21 | Paper |
scientific article; zbMATH DE number 1931089 (Why is no real title available?)
| 2003-06-19 | Paper |
Compilation of vector statements of C[ language for architectures with multilevel memory hierarchy]
Programming and Computer Software | 2002-01-06 | Paper |
On closed classes containing precomplete classes of the set of all one-place functions
Moscow University Mathematics Bulletin | 1999-01-14 | Paper |
