Swarm Robotics (SR) is an interdisciplinary field that is rapidly advancing to address
complex industrial challenges. This paper provides a comprehensive review of recent …

A new approach to the construction of lower bounds of quadratic function the permutation
matrix set, based on the utilization of functional representations and convex extensions, is …

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems,
and most existing algorithms are challenging for solving TSPs when their scale is large. To …

We formalize uncertainty concept, compromise criteria of uncertainty minimization, and
efficient formal procedures for a sufficiently common class of combinatorial optimization …

Previously, the author formalized the concepts of uncertainty, compromise solution,
compromise criteria and conditions for a quite general class of combinatorial optimization …

We propose an efficient original solution to the problem of long-term operational planning
under uncertainty conditions for arbitrary objects with a network representation of …

The efficiency of applying the general theoretical positions proposed by AA Pavlov to find a
compromise solution for one class of combinatorial optimization problems under uncertainty …

A single machine total weighted tardiness minimization (TWTM) problem in operational
planning is considered. The problem is formulated as an NP-hard constrained combinatorial …

Combinatorial optimization is an important area in computer science that uses combinatorics
to solve discrete optimization problems. In this thesis, we considered a combinatorial …

На практике определение наилучшего варианта действий часто производится в
условиях неопределенности. Последствия принимаемых решений зависят от будущего …