Volume 26, 2019
Content

No 1

S. E. Bukhtoyarov and V. A. Emelichev
Stability aspects of multicriteria integer linear programming problems
P. 5-19

V. A. Voblyi
The second Riddel relation and its consequences
P. 20-32

Sh. I. Galiev and A. V. Khorkov
On the number and arrangement of sensors for the multiple covering of bounded plane domains
P. 33-54

A. V. Gubareva, A. A. Panin, A. V. Plyasunov, and L. V. Som
On a three-level competitive pricing problem with uniform and mill pricing strategies
P. 55-73

D. S. Malyshev and D. B. Mokeev
König graphs with respect to the 4-path and its spanning supergraphs
P. 74-88

K. A. Popkov
Short complete fault detection tests for logic networks with fan-in two
P. 89-113

V. I. Shmyrev
Polyhedral complementarity on a simplex: Search for fixed points of decreasing regular mappings
P. 114-134

No 2

V. L. Beresnev and A. A. Melnikov
A cut generation algorithm of finding an optimal solution in a market competition
P. 5-29

A. N. Glebov and S. G. Toktokhoeva
A polynomial 3/5-approximate algorithm for the asymmetric maximization version of 3-PSP
P. 30-59

P. A. Kononova and Yu. A. Kochetov
A local search algorithm for the single machine scheduling problem with setups and a storage
P. 60-78

K. G. Kuzmin and V. R. Haritonova
Estimating the stability radius of an optimal solution to the simple assembly line balancing problem
P. 79-97

D. A. Makarov and A. D. Yashunsky
On a construction of easily decodable sub-de Bruijn arrays
P. 98-114

M. I. Rozhkov and S. S. Malakhov
Experimental methods for constructing MDS matrices of a special form
P. 115-128

A. A. Sapozhenko and V. G. Sargsyan
Asymptotics for the logarithm of the number of $(k, l)$-solution-free collections in an interval of naturals
P. 129-144

No 3

I. S. Bykov
2-Factors without close edges in the $n$-dimensional cube
P. 5-26

A. V. Kononov, A. A. Panin, and A. V. Plyasunov
A bilevel competitive location and pricing model with nonuniform split of demand
P. 27-45

S. N. Selezneva
On $m$-junctive predicates on a finite set
P. 46-59

R. Yu. Simanchev, I. V. Urazova, and Yu. A. Kochetov
The branch and cut method for the clique partitioning problem
P. 60-87

F. S. Stonyakin, M. Alkousa, A. N. Stepanov, and A. A. Titov
Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
P. 88-114

I. P Chukhrov
On the minimization of Boolean functions for additive complexity measures
P. 115-140

No 4

S. V. Avgustinovich and E. V. Gorkunov
Maximum intersection of linear codes and codes equivalent to linear
P. 5-15

V. L. Beresnev and A. A. Melnikov
A bilevel “Attacker–Defender” model to choosing the composition of attack means
P. 16-33

V. A. Vasil’ev
Undominatedness of equilibria in a mixed economy of Arrow–Debreu type
P. 34-55

A. A. Romanova and V. V. Servakh
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
P. 56-73

K. L. Rychkov
On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube
P. 74-107

I. S. Sergeev
On a relation between the depth and complexity of monotone Boolean formulas
P. 108-120

A. S. Shaporenko
Relationship between homogeneous bent functions and Nagy graphs
P. 121-131