Geodesic

Sommaire du Fascicule no. 1

The location problem on networks with bounded communication capacities
p. 3-11
The behavior of probabilistic greedy algorithms for a~multistage location problem
p. 12-32
New algorithms for optimization in the cone of the central path
p. 33-42
A~new version of the Hungarian method for finding equilibrium in a~linear exchange model
p. 43-60
The Hungarian method for finding equilibrium in a~linear exchange model with fixed budgets
p. 61-77

Sommaire du Fascicule no. 2

A~two-level standardization problem with the uniqueness condition for the optimal consumption choice
p. 3-11
Approximate solution of a~linear programming problem by the method of potential functions
p. 12-22
On two types of stability in a~vector linear-quadratic Boolean programming problem
p. 23-31
A~program package for integer linear programming
p. 32-41
A~problem of constructing a~hierarchical structure
p. 42-47
Enumeration of perfect binary codes of length~15
p. 48-73

Sommaire du Fascicule no. 3

Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
p. 3-9
On transformations that improve the reliability of parts of circuits in automaton bases
p. 10-41
Modeling of circuits consisting of functional elements by Turing machines
p. 42-70
Residual reliability of P-threshold graphs
p. 71-86
On the complexity of problems of minimization and compression of models of sequential choice
p. 87-109

Sommaire du Fascicule no. 4

A~polynomial algorithm for finding the largest independent sets in claw-free graphs
p. 3-19
Acyclic coloring of 1-planar graphs
p. 20-35
On the connected coloring of graphs in prescribed colors
p. 36-43
On a~lower bound for the number of perfect binary codes
p. 44-48
A~survey of methods for the undistorted coding of discrete sources
p. 49-91
On graphs of subwords of DOL-sequences
p. 92-103
Maximization of a~linear objective function by a~greedy algorithm
p. 104-120
New books for discrete mathematics
p. 123-124