Geodesic

Sommaire du Fascicule no. 1

The plant location problem on a~two-tree with bounded communication capacities
p. 3-8
Polynomial solvability of scheduling problems with storable resources and directive deadlines
p. 9-34
Two-level standardization problems under conditions when the optimal consumer choice is not unique
p. 35-46
A~genetic algorithm for the covering problem
p. 47-60
On the problem of the linear ordering of vertices of parallel-sequential graphs
p. 61-64
An efficient algorithm for the approximate solution of the metric traveling salesman problem
p. 65-74
An efficiently solvable case of the scheduling problem with renewable resources
p. 75-82
Outerplanar graphs with the metric continuation property. I
p. 83-112

Sommaire du Fascicule no. 2

International Conference DAOR'2000
p. 3-4
A~two-level problem of the choice of reusable products with the uniqueness condition for consumer choice
p. 5-11
On a~linear convolution of criteria in vector discrete optimization
p. 12-21
The set covering problem: complexity, algorithms, and experimental investigations
p. 22-46
Analysis of the stability of an L-partition of sets in a~finite-dimensional space
p. 47-53
A~two-level bimatrix game with payoff regulation
p. 54-59
Construction of triply connected graphs with the same path layer matrices
p. 60-73
The branch-and-bound method for the problem of minimizing a~nonconvex quadratic function under convex quadratic constraints
p. 74-88
A~polynomially solvable class of two-level nonlinear programming problems
p. 89-113
On a~two-level location problem with constraints on the volume of production
p. 114-118

Sommaire du Fascicule no. 3

On the strong isometry of binary codes
p. 3-5
The coloring of the incidentors and vertices of a~directed multigraph
p. 6-16
The number of special monotone Boolean functions and statistical properties of stack filters
p. 17-44
On diagnostic and adjustment problems for circuits composed of unreliable automata
p. 45-71
On an algorithm for the edge coloring of multigraphs
p. 72-85
Lower bounds for the formula complexity of symmetric Boolean functions
p. 86-98

Sommaire du Fascicule no. 4

International Conference DAOR'2000
p. 3-4
On a~structural property of plane graphs
p. 5-19
On the entropy of hereditary classes of oriented graphs
p. 20-28
On the (k,l)-coloring of incidentors
p. 29-37
On the applicability of a coordinate-wise ascent algorithm to integer programming problems
p. 38-47
Coding of structured information and embeddings of discrete spaces
p. 48-58
A~four-parameter analysis of the complexity of the open shop problem
p. 59-77
Z4-linear perfect codes
p. 78-90
On the order of the automorphism group of perfect binary codes
p. 91-100
Perfect binary codes and Steiner triple systems with maximum orders of automorphism groups
p. 101-110
Generalization of the concept of the rank function of a~matroid
p. 111-125
New books for discrete mathematics
p. 129-131