Personal information

Other IDs

ResearcherID: E-8738-2014
Scopus Author ID: 55893068900

Activities

Collapse all

Works (50 of 71)

Items per page:
Page 1 of 2

Bicentered Interval Newton Operator for Robot’s Workspace Approximation

2023 | Book chapter
DOI: 10.1007/978-3-031-47859-8_25
Contributors: Artem Maminov; Mikhail Posypkin
Source: check_circle
Crossref

Probabilistic Modeling of the Behavior of a Computing Node in the Absence of Tasks on the Project Server

2023 | Book chapter
DOI: 10.1007/978-3-031-49435-2_5
Contributors: Khrapov Nikolay; Posypkin Mikhail
Source: check_circle
Crossref

A two-phase heuristic algorithm for power-aware offline scheduling in IaaS clouds

Journal of Parallel and Distributed Computing
2023-08 | Journal article
DOI: 10.1016/j.jpdc.2023.03.006
Contributors: A. Ignatov; I. Maslova; M. Posypkin; W. Yang; J. Wu
Source: check_circle
Crossref

Robot Workspace Approximation with Modified Bicenetred Krawczyk Method

2022 | Book chapter
DOI: 10.1007/978-3-031-22543-7_17
Contributors: Artem Maminov; Mikhail Posypkin
Source: check_circle
Crossref

Preface to the Special Issue on “Control, Optimization, and Mathematical Modeling of Complex Systems”

Mathematics
2022-06-23 | Journal article
DOI: 10.3390/math10132182
Contributors: Mikhail Posypkin; Andrey Gorshenin; Vladimir Titarev
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

Techniques for Speeding up H-Core Protein Fitting

2021 | Book chapter
DOI: 10.1007/978-3-030-91059-4_24
Contributors: Andrei Ignatov; Mikhail Posypkin
Source: check_circle
Crossref

Automatic Convexity Deduction for Efficient Function’s Range Bounding

Mathematics
2021-01-10 | Journal article
DOI: 10.3390/math9020134
Contributors: Mikhail Posypkin; Oleg Khamisov
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

A Criterion of Optimality of Some Parallelization Scheme for Backtrack Search Problem in Binary Trees

2020 | Book chapter
DOI: 10.1007/978-3-030-38603-0_33
Contributors: Roman Kolpakov; Mikhail Posypkin
Source: check_circle
Crossref

Piecewise linear bounding functions in univariate global optimization

Soft Computing
2020-12-19 | Journal article
DOI: 10.1007/s00500-020-05254-3
Contributors: Mikhail Posypkin; Alexander Usov; Oleg Khamisov
Source: check_circle
Crossref

Piecewise Linear Bounding Functions for Univariate Global Optimization

2019 | Book chapter
DOI: 10.1007/978-3-030-10934-9_13
Contributors: Oleg Khamisov; Mikhail Posypkin; Alexander Usov
Source: check_circle
Crossref

The Scalability Analysis of a Parallel Tree Search Algorithm

2019 | Book chapter
DOI: 10.1007/978-3-030-10934-9_14
Contributors: Roman Kolpakov; Mikhail Posypkin
Source: check_circle
Crossref

Об эффективной стратегии распараллеливания при решении задач о сумме подмножеств методом ветвей и границ

Дискретная математика
2019 | Journal article
DOI: 10.4213/dm1526
Contributors: Roman Maksimovich Kolpakov; Mikhail Anatol'evich Posypkin
Source: check_circle
Crossref

Параллельный метод липшицевой глобальной оптимизации

Международный научный журнал "Современные информационные технологии и ИТ-образование"
2019-07-25 | Journal article
DOI: 10.25559/SITITO.15.201902.340-350
Contributors: М.А. ПОСЫПКИН; А.С. ГОРБУНОВ
Source: check_circle
Crossref

Approximating a solution set of nonlinear inequalities

Journal of Global Optimization
2018-05-23 | Journal article
DOI: 10.1007/s10898-017-0576-z
Contributors: Yuri Evtushenko; Mikhail Posypkin; Larisa Rybak; Andrei Turkin
Source: check_circle
Crossref

Сравнение вариантов многопоточной реализации метода ветвей и границ для многоядерных систем

Международный научный журнал "Современные информационные технологии и ИТ-образование"
2018-03-30 | Journal article
DOI: 10.25559/SITITO.14.201801.138-148
Contributors: Ю. ГОРЧАКОВ А; А. ПОСЫПКИН М
Source: check_circle
Crossref

Branch and bound method on desktop grid systems

Proceedings of the 2017 IEEE Russia Section Young Researchers in Electrical and Electronic Engineering Conference, ElConRus 2017
2017 | Conference paper
DOI: 10.1109/EIConRus.2017.7910607
EID:

2-s2.0-85019461449
Contributors: Posypkin, M.; Khrapov, N.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Complexity of solving the Subset Sum problem with the branch-and-bound method with domination and cardinality filtering

Automation and Remote Control
2017 | Journal article
DOI: 10.1134/S0005117917030079
EID:

2-s2.0-85014880774
Contributors: Kolpakov, R.M.; Posypkin, M.A.; Sin, S.T.T.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

The non-uniform covering approach to manipulator workspace assessment

Proceedings of the 2017 IEEE Russia Section Young Researchers in Electrical and Electronic Engineering Conference, ElConRus 2017
2017 | Conference paper
DOI: 10.1109/EIConRus.2017.7910573
EID:

2-s2.0-85019479465
Contributors: Evtushenko, Y.; Posypkin, M.; Turkin, A.; Rybak, L.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

О наилучшем выборе переменной ветвления в задаче о сумме подмножеств

Дискретная математика
2017 | Journal article
DOI: 10.4213/dm1405
Contributors: Roman Maksimovich Kolpakov; Mikhail Anatol'evich Posypkin
Source: check_circle
Crossref

THE EFFECTIVENESS OF LOCAL SEARCH METHODS IN THE PROBLEM OF FINDING THE MINIMUM ENERGY OF A 2-D CRYSTAL

Международный научный журнал "Современные информационные технологии и ИТ-образование"
2017-08-18 | Journal article
DOI: 10.25559/SITITO.2017.2.247
Contributors: А.Ю. Горчаков; М.А. Посыпкин
Source: check_circle
Crossref

A tool for simulating parallel branch-and-bound methods

Open Engineering
2016 | Journal article
DOI: 10.1515/eng-2016-0031
EID:

2-s2.0-84990050167
Contributors: Golubeva, Y.; Orlov, Y.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Application of optimization methods for finding equilibrium states of two-dimensional crystals

Computational Mathematics and Mathematical Physics
2016 | Journal article
DOI: 10.1134/S0965542516120083
EID:

2-s2.0-85006931047
Contributors: Evtushenko, Y.G.; Lurie, S.A.; Posypkin, M.A.; Solyaev, Y.O.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Comparative analysis of the efficiency of various dynamic programming algorithms for the knapsack problem

Proceedings of the 2016 IEEE North West Russia Section Young Researchers in Electrical and Electronic Engineering Conference, EIConRusNW 2016
2016 | Conference paper
DOI: 10.1109/EIConRusNW.2016.7448182
EID:

2-s2.0-84966680023
Contributors: Posypkin, M.; Sin, S.T.T.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Method for approximating the workspace of the parallel robot

International Journal of Pharmacy and Technology
2016 | Journal article
EID:

2-s2.0-85018204527
Contributors: Rybak, L.A.; Posypkin, M.A.; Turkin, A.V.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

New optimization problems arising in modelling of 2D-crystal lattices

AIP Conference Proceedings
2016 | Conference paper
DOI: 10.1063/1.4965341
EID:

2-s2.0-84995451035
Contributors: Evtushenko, Y.; Lurie, S.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

The lower bound on complexity of parallel branch-and-bound algorithm for subset sum problem

AIP Conference Proceedings
2016 | Conference paper
DOI: 10.1063/1.4965329
EID:

2-s2.0-84995436849
Contributors: Kolpakov, R.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

The upper bound on the complexity of branch-and-bound with cardinality bound for subset sum problem

AIP Conference Proceedings
2016 | Conference paper
DOI: 10.1063/1.4965330
EID:

2-s2.0-84995475804
Contributors: Sin, S.T.T.; Posypkin, M.; Kolpakov, R.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Using general lattice program on the desktopgrid systems

CEUR Workshop Proceedings
2016 | Conference paper
EID:

2-s2.0-85016206545
Contributors: Posypkin, M.A.; Khrapov, N.P.; Rozen, V.V.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Using necessary optimality conditions for acceleration of the nonuniform covering optimization method

Open Engineering
2016 | Journal article
DOI: 10.1515/eng-2016-0027
EID:

2-s2.0-84989957178
Contributors: Evtushenko, Y.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Using simulation for performance analysis and visualization of parallel branch-and-bound methods

Communications in Computer and Information Science
2016 | Book
DOI: 10.1007/978-3-319-55669-7_28
EID:

2-s2.0-85015876924
Contributors: Evtushenko, Y.; Golubeva, Y.; Orlov, Y.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Volunteer computing for computational materials design

CEUR Workshop Proceedings
2016 | Conference paper
EID:

2-s2.0-85009431542
Contributors: Oganov, A.; Posypkin, M.; Rozen, V.; Santsevich, A.; Sukhomlin, V.; Khrapov, N.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

A deterministic method for constrained multicriteria optimization

6th International Conference on Modeling, Simulation, and Applied Optimization, ICMSAO 2015 - Dedicated to the Memory of Late Ibrahim El-Sadek
2015 | Conference paper
DOI: 10.1109/ICMSAO.2015.7152218
EID:

2-s2.0-84941124501
Contributors: Evtushenko, Y.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Complexity based load balancing for distributed branch and bound method

2015 5th International Workshop on Computer Science and Engineering: Information Processing and Control Engineering, WCSE 2015-IPCE
2015 | Conference paper
EID:

2-s2.0-84939540757
Contributors: Tian, B.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Technology for integrating idle computing cluster resources into volunteer computing projects

2015 5th International Workshop on Computer Science and Engineering: Information Processing and Control Engineering, WCSE 2015-IPCE
2015 | Conference paper
EID:

2-s2.0-84939493823
Contributors: Afanasiev, A.P.; Bychkov, I.V.; Manzyuk, M.O.; Posypkin, M.A.; Semenov, A.A.; Zaikin, O.S.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

A deterministic algorithm for global multi-objective optimization

Optimization Methods and Software
2014 | Journal article
DOI: 10.1080/10556788.2013.854357
EID:

2-s2.0-84903519737
Contributors: Evtushenko, Y.G.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Effective hull of a set and its approximation

Doklady Mathematics
2014 | Journal article
DOI: 10.1134/S1064562414070278
EID:

2-s2.0-84920861101
Contributors: Evtushenko, Y.G.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy

Automation and Remote Control
2014 | Journal article
DOI: 10.1134/S0005117914060046
EID:

2-s2.0-84903289297
Contributors: Evtushenko, Yu.G.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Optimization methods as applied to parametric identification of interatomic potentials

Computational Mathematics and Mathematical Physics
2014 | Journal article
DOI: 10.1134/S0965542514120021
EID:

2-s2.0-84919705173
Contributors: Abgaryan, K.K.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Searching of gapped repeats and subrepetitions in a word

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2014 | Book
DOI: 10.1007/978-3-319-07566-2_22
EID:

2-s2.0-84958529897
Contributors: Kolpakov, R.; Podolskiy, M.; Posypkin, M.; Khrapov, N.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

A deterministic approach to global box-constrained optimization

Optimization Letters
2013 | Journal article
DOI: 10.1007/s11590-012-0452-1
EID:

2-s2.0-84875409113
Contributors: Evtushenko, Y.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Method for solving constrained multicriteria optimization problems with guaranteed accuracy

Doklady Mathematics
2013 | Journal article
DOI: 10.1134/S1064562413040273
EID:

2-s2.0-84887256832
Contributors: Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy

Computational Mathematics and Mathematical Physics
2013 | Journal article
DOI: 10.1134/S0965542513020061
EID:

2-s2.0-84874532284
Contributors: Evtushenko, Y.G.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

A deterministic algorithm for global optimization

Lecture Notes in Economics and Mathematical Systems
2012 | Book
DOI: 10.1007/978-3-642-22884-1_10
EID:

2-s2.0-84870516467
Contributors: Evtushenko, Y.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

A comparative study of different optimization algorithms for molecular docking

CEUR Workshop Proceedings
2011 | Conference paper
EID:

2-s2.0-84892504663
Contributors: Afanasiev, A.; Oferkin, I.; Posypkin, M.; Rubtsov, A.; Sulimov, A.; Sulimov, V.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems

Computational Mathematics and Mathematical Physics
2011 | Journal article
DOI: 10.1134/S0965542511080082
EID:

2-s2.0-80051733000
Contributors: Evtushenko, Y.G.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

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
2011 | Journal article
DOI: 10.1134/S106423071105011X
EID:

2-s2.0-84855483475
Contributors: Kolpakov, R.M.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2011 | Book
DOI: 10.1007/978-3-642-23178-0_43
EID:

2-s2.0-80053101332
Contributors: Semenov, A.; Zaikin, O.; Bespalov, D.; Posypkin, M.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Versions of the method of nonuniform coverings for global optimization of mixed integer nonlinear problems

Doklady Mathematics
2011 | Journal article
DOI: 10.1134/S1064562411020074
EID:

2-s2.0-79957998293
Contributors: Evtushenko, Yu.G.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

Automation and Remote Control
2010 | Journal article
DOI: 10.1134/S0005117910100140
EID:

2-s2.0-77958460514
Contributors: Kolpakov, R.M.; Posypkin, M.A.; SigalI.Kh.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier

Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem

Discrete Mathematics and Applications
2010 | Journal article
DOI: 10.1515/DMA.2010.007
EID:

2-s2.0-77952644856
Contributors: Kolpakov, R.M.; Posypkin, M.A.
Source: Self-asserted source
Mikhail Posypkin via Scopus - Elsevier
Items per page:
Page 1 of 2

Peer review (1 review for 1 publication/grant)

Review activity for Optimization letters. (1)
How many people are using ORCID?