The following pages link to Mikhail A. Posypkin (Q828197):
Displaying 22 items.
- (Q220316) (redirect page) (← links)
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Method for solving constrained multicriteria optimization problems with guaranteed accuracy (Q393863) (← links)
- Application of optimization methods for finding equilibrium states of two-dimensional crystals (Q518578) (← links)
- On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method (Q612225) (← links)
- Versions of the method of nonuniform coverings for global optimization of mixed integer nonlinear problems (Q656311) (← links)
- A combined parallel algorithm for solving the knapsack problem (Q734010) (← links)
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- Optimization methods as applied to parametric identification of interatomic potentials (Q889221) (← links)
- Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy (Q891206) (← links)
- On closed classes containing precomplete classes of the set of all one-place functions (Q1275995) (← links)
- Refined description of the C[] language (Q1403262) (← links)
- (Q1679606) (redirect page) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- Finding sets of solutions to systems of nonlinear inequalities (Q1683169) (← links)
- On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)
- Approximating a solution set of nonlinear inequalities (Q1754455) (← links)
- A deterministic approach to global box-constrained optimization (Q1947630) (← links)
- A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees (Q1982929) (← links)
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149) (← links)
- Comparison of parallel implementations of the branch-and-bound method for shared memory systems (Q6178124) (← links)
- Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (Q6200659) (← links)
