Geodesic

Sommaire du Fascicule no. 1

On problems of efficient barter
p. 3-11
On a~problem of the choice of a~cyclic route and loading of transport vehicles
p. 12-18
The branch and bound method for the simplest two-level problem of facility location
p. 19-39
Keeping the armed forces structure in the armed struggle process
p. 40-55

Sommaire du Fascicule no. 2

An approximate algorithm for the problem of minimizing polynomials of Boolean variables
p. 3-19
Algorithms for and the complexity of the solution of two-level standardization problems with correction of revenue
p. 20-33
The Wiener index for trees and graphs of hexagonal systems
p. 34-60

Sommaire du Fascicule no. 3

Locally bounded hereditary subclasses of k-colorable graphs
p. 3-16
Problems in scheduling theory on a~single machine with job durations proportional to an arbitrary function
p. 17-37
Upper bounds for the complexity of symbol sequences generated by symmetric Boolean functions
p. 38-43
Minimal self-correcting schemes for a sequence of Boolean functions
p. 44-63
On the problem of the maximum spanning tree of bounded radius
p. 64-69
Search costs and interval graphs
p. 70-79
Self-correcting schemes that realize ``narrow'' systems of linear Boolean functions
p. 80-95

Sommaire du Fascicule no. 4

On the structure of minimal distance graphs of perfect binary (n,3)-codes
p. 3-5
The height of small faces in planar normal maps
p. 6-17
Edge and total coloring of interval graphs
p. 18-24
On the distance between perfect binary codes
p. 25-29
On problems of lexicographic optimization
p. 30-37
Distance-preserving cyclic codes on a linear basis
p. 38-44
An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a~supermodular function
p. 45-60
On cyclic ⟨m,n⟩-numerations
p. 61-70
On the algorithmic complexity of the classical reliability problem
p. 71-80
Fast coding of Markov sources with low entropy
p. 81-96
New books for discrete mathematics
p. 97-99