Geodesic

Sommaire du Fascicule no. 1

On a~property of perfect binary codes
p. 4-6
On the complexity of the realization of Boolean functions by circuits in an infinite basis
p. 7-20
On the scheduling of jobs on one machine with nonlinearly dependent processing times
p. 21-35
Dynamic problems of the choice of optimal composition of a~facility's machinery
p. 36-49
The traveling salesman problem for a~maximum in finite-dimensional real spaces
p. 50-56
Estimates for the approximate solution of~ascheduling problem
p. 57-67
School-seminar ``Synthesis and Complexity of Controlled Systems''
p. 98-81

Sommaire du Fascicule no. 2

On discrete approximations of continuous functions with a~bounded second derivative
p. 5-15
Spectral properties of perfect binary (n,3)-codes
p. 16-25
Problems of the reconstruction of words from fragments, and their applications
p. 26-48
On closed classes in k-valued logic that contain a homogeneous switching function
p. 49-61
Strongly essential variables of functions of k-valued logic
p. 62-68
Nonstrict summation of vectors in the plane, and its application in problems of scheduling theory
p. 69-100

Sommaire du Fascicule no. 3

Neighborhoods of edges in normal cards
p. 3-9
On an upper bound for the length of a~snake in an n-dimensional unit cube
p. 10-17
Deciphering of threshold functions of k-valued logic
p. 18-23
A~vertex variant of the Kleitman--West problem
p. 24-48
Operations and isometric embeddings of graphs, which are associated with the property of metric continuation.
p. 49-67
International conference ``Mathematical Models in Control-System Theory''
p. 68-84

Sommaire du Fascicule no. 4

Distributive coloring of graph vertices
p. 3-12
Efficient algorithms for solving a~multistage facility location problem on a~path
p. 13-31
Lower bounds in the problem of the choice of composition of machinery in a~two-level system
p. 32-41
On regular graphs in which each edge lies in the largest number of triangles
p. 42-53
On the comparison of the complexities of binary k-programs
p. 54-73
Some problems for optimizing the routing of messages in a~local communication network
p. 74-79
On some estimates for the weight of l-balanced Boolean functions
p. 80-96
New books for discrete mathematics
p. 97-99