Geodesic

Sommaire du Fascicule no. 1

Equilibrium in a~regulated market. I.~Existence
p. 3-21
On some results for the maximum traveling salesman problem
p. 22-39
A~three-level model for the choice of nomenclature of products
p. 40-46
Stability and regularization of vector problems of integer linear programming
p. 47-69
The problem of locating rectangular plants with minimal cost for the connecting network
p. 70-87
Outerplanar graphs with the metric continuity property.~II
p. 88-112

Sommaire du Fascicule no. 2

An asymptotically exact algorithm for solving the location problem with constrained production volumes
p. 3-16
Oblique path algorithms for solving linear programming problems
p. 17-26
A~continuous process for the linear complementarity problem
p. 27-30
The use of the interior point method for the realization of a~model for the estimation of the power deficit of electrical power systems
p. 31-41
A~two-level assignment problem
p. 42-51
A~new approximate algorithm for solving a~positive linear programming problem
p. 52-72
The branch and bound method for solving the problem of linear ordering on weighted tournaments
p. 73-91
Выходит в свет книга

Sommaire du Fascicule no. 3

The coloring of the incidentors and vertices of an undirected multigraph
p. 3-14
On the description of a~class of problems solvable by a~coordinate-wise ascent algorithm
p. 15-25
A~lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages
p. 26-45
On conditional tests for the control of automata networks
p. 46-72
On the isometric embedding of arbitrary graphs into a~graph of a~given diameter possessing the metric continuation property
p. 73-80

Sommaire du Fascicule no. 4

Perfect codes of complete rank with kernels of large dimensions
p. 3-8
Minimal degrees and chromatic numbers of squares of planar graphs
p. 9-33
On the partition of a~planar graph of girth~5 into an empty and an acyclic subgraph
p. 34-53
For what~k in almost every n-vertex graph do there exist all nonisomorphic k-vertex subgraphs?
p. 54-67
Positive BE-representations of dictionary predicates
p. 68-75
On a~method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
p. 76-102
On the complexity of realization of powers of Boolean functions by formulas
p. 103-111
New books for discrete mathematics
p. 114-116