Geodesic

Sommaire du Fascicule no. 1

From Editorial Board
Mathematical models of planning the development of technical means
p. 4-29
On some problems of mutual amortization of enterprises
p. 30-39
Lower bounds for the objective function in a~dynamic problem of the choice of optimal composition of machinery in a~two-level system
p. 40-53
A~model for the estimation of the opposition of two coalitions
p. 54-64

Sommaire du Fascicule no. 2

Bicyclic graphs and their edge graphs with coinciding Wiener index
p. 3-9
Matchings in geometric bipartite graphs
p. 10-22
A~polynomially solvable class of two-level linear programming problems
p. 23-33
Superconcurrent distribution of flows in multicommodity networks
p. 34-54
An approximate algorithm for solving a~dynamic problem on the p-median for a maximum
p. 55-62

Sommaire du Fascicule no. 3

Complexity of the determination of the maximum weighted joining in a~graph
p. 3-8
Minimal coverings of a~Boolean cube by centered antichains
p. 9-17
On the number of connected sets with given cardinality of a~neighborhood in a~graph
p. 18-34
On the accuracy of solutions of location problems for a~maximum by greedy algorithms
p. 35-48
On the computation of Boolean functions by probabilistic programs
p. 49-68
Local complexity of Boolean functions
p. 69-80

Sommaire du Fascicule no. 4

On the partition of a~set of edges of a~graph into isomorphic trees
p. 3-5
Minimal numerations of subsets of a~finite set, and the problem of the Hamiltonicity of the graph of the middle layers of a~hypercube
p. 6-12
On the asymptotics of the number of binary words with a~given length of a~maximal series.~I
p. 13-46
On the reconstruction of the correct operation of faulty parts of combinational circuits
p. 47-74
On nonsystematic perfect codes of length~15
p. 75-78
On an infinite sequence of improvable Boolean bases
p. 79-95
Second School on Graph Theory
p. 96-111
New books for discrete mathematics
p. 112-114