Geodesic

Sommaire du Fascicule no. 1

Algorithms with improved estimates for accuracy for the set covering problem
p. 3-10
Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight
p. 11-25
New results in the theory of search
p. 26-50
On an efficient method for convex programming
p. 51-61
Solution of systems of two-sided linear inequalities by interior-point algorithms using the example of a model of the operating conditions of electrical power systems
p. 62-79
Families of planar 4-homogeneous 4-critical graphs
p. 79-115

Sommaire du Fascicule no. 2

Construction of a relaxation of the polytope of the symmetric traveling salesman problem on the basis of a well-solvable Kalmanson case
p. 3-24
The Wiener index for graphs and their edge graphs
p. 25-44
Automatic global optimization
p. 45-68
On Lagrangian relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume
p. 69-93

Sommaire du Fascicule no. 3

On the mean complexity of Boolean functions defined by Zhegalkin polynomials
p. 3-15
Closed classes of finite distributions of rational probabilities
p. 16-31
Remarks on the finite generability of closed classes of multivalued functions
p. 32-47
On the maximum length of binary words with bounded frequency of units and without identical subwords of given length
p. 48-58
On the (1,1)-coloring of incidentors of multigraphs of degree 4
p. 59-62
Chain decompositions by distances, and graph isomorphisms
p. 63-79
On partitions of q-ary Hamming codes into disjoint components
p. 80-87
Recognition of the properties of order relations in discrete spaces
p. 88-110

Sommaire du Fascicule no. 4

Approximate computation of the weight function of a linear binary code
p. 3-19
Statistical patterns of the interaction of periods of partial words
p. 20-35
On a generalization of the minimax assignment problem
p. 36-43
On the complexity of the inversion of discrete functions of a certain class
p. 44-55
The property of metric continuation of the shortest paths in graphs
p. 56-67
On the average monotone complexity of Boolean functions
p. 68-80
Totally balanced and exponentially balanced Gray codes
p. 81-98
New books for discrete mathematics
p. 99-100