Volume 29, 2022
Content

No 1

V. V. Voroshilov
Complexity of the max cut problem with the minimal domination constraint
P. 5-17

O. A. Kutnenko
Computational complexity of two problems of cognitive data analysis
P. 18-32

M. A. Lisitsyna and S. V. Avgustinovich
On perfect colorings of paths divisible by a matching
P. 33-45

A. V. Pyatkin and O. I. Chernykh
On the maximum number of open triangles in graphs with the same number of vertices and edge
P. 46-55

S. N. Selezneva
On complexity of searching for periods of functions given by polynomials over a prime field
P. 56-73

I. P. Chukhrov
Properties of Boolean functions with the extremal number of prime implicants
P. 74-93

No 2

Yu. A. Kochetov, V. A. Legkokonets, A. A. Panin, A. V. Plyasunov, and L. V. Som
The problem of gas treatment and transportation
P. 5-23

V. K. Leontiev
On the Frobenius problem
P. 24-37

D. S. Malyshev and O. I. Duginov
Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests
P. 38-61

S. A. Novoselov and Yu. F. Boltnev
On the number of points on the curve $y^2 = x^7 + ax^4 + bx$ over a finite field
P. 62-79

No 3

V. L. Beresnev and A. A. Melnikov
Computing an upper bound in the two-stage bi-level competitive location model
P. 7-23

V. N. Krutikov, P. S. Stanimirovi$\acute{c}$, O. N. Indenko, E. M. Tovbis, and L. A. Kazakovtsev
Optimization of subgradient method parameters on the base of rank-two correction of metric matrices
P. 24-44

S. M. Lavlinskii, A. A. Panin, and A. V. Plyasunov
A model of economic policy making with transaction costs and breach-of-contract risk insurance
P. 45-63

E. A. Nurminskiy and N. B. Shamray
Modeling and optimizing large-scale production-level transportation systems
P. 64-84

A. V. Ratushnyi and Yu. A. Kochetov
A matheuristic for minimization of waiting time for trailers with uncertain arrival times
P. 85-101

S. M. Shperling and Yu. A. Kochetov
A knapsack problem for rectangles under the gravity center constraints
P. 102-115

No 4

V. A. Voblyi
On asymptotic enumeration of labeled series-parallel $k$-cyclic graphs
P. 5-14

E. N. Goncharov
Local search algorithm for the resource-constrained project scheduling problem
P. 15-37

A. E. Doronin and K. V. Kalgin
Application of SAT solvers to the problem of finding vector Boolean functions with required cryptographic properties
P. 38-58

E. A. Monakhova and O. G. Monakhov
Construction of series of families of degree six circulant networks
P. 59-76

K. L. Rychkov
Representations of normalized formulas
P. 77-103

Yu. V. Tarannikov
On the existence of Agievich-primitive partitions
P. 104-123

E. E. Trifonova
On some properties of finitely generating transformer sets for $p$-ary fractions
P. 124-135