Geodesic

Sommaire du Fascicule no. 1

On a~wide class of bases with unreliability coefficient equal to one
p. 5-18
On an extremal inverse problem in graph theory
p. 19-31
Affine 3-nonsystematic perfect codes of length~15
p. 32-50
Full detecting tests for Boolean functions for local linear faults of circuits' inputs
p. 51-63
Numerical search for global solutions in problems of non-symmetric bilinear separability
p. 64-85
About searching for antipodal vertexes in symmetric Cayley graphs
p. 86-99

Sommaire du Fascicule no. 2

On stability of solutions of a~vector variant of one investment problem
p. 5-16
On coloring problems for the two-season multigraphs
p. 17-26
Cyclic properties of topological graphs of a~hexagonal grid
p. 27-48
On complexity of solving systems of functional equations in countable-valued logic
p. 49-62
On interval (1,1)-coloring of incidentors of interval colorable graphs
p. 63-72
Counting sumsets and differences in abelian group
p. 73-85
On the faces of the graph approximation problem polytope
p. 86-101

Sommaire du Fascicule no. 3

A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum
p. 5-17
Comparison of three approaches to studing stability of solutions to discrete optimization and computational geometry problems
p. 18-35
Comparison of metaheuristics for the bilevel facility location and mill pricing problem
p. 36-54
The maximal flow problem on networks with special conditions of flow distribution
p. 55-74
On the problem of minimizing a~single set of Boolean functions
p. 75-97

Sommaire du Fascicule no. 4

Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded from below
p. 5-20
About density of a~covering of a~strip with identical sectors
p. 21-34
The complexity of the project scheduling problem with credits
p. 35-49
An exact pseudopolynomial algorithm for a~bi-partitioning problem
p. 50-62
Effective algorithms for one scheduling problem on two machines with makespan minimization
p. 63-79

Sommaire du Fascicule no. 5

Hybrid local search for the heterogenous fixed fleet vehicle routing problem
p. 5-29
A united approach to finding the stability radii in a~multicriteria problem of a~maximum cut
p. 30-51
Estimations on lengths of tests of functional elements under a~large number of permissible faults
p. 52-70
Sufficient conditions for the minimal π-schemes for linear Boolean functions to be locally non-repeating
p. 71-85

Sommaire du Fascicule no. 6

Multiple circle coverings of an equilateral triangle, square, and circle
p. 5-28
Searching for record circulant graphs using a~parallel genetic algorithm
p. 29-42
The diversity vector of balls of a~typical graph of small diameter
p. 43-54
A three-phase heuristic for the vehicle fleet and route optimization
p. 55-77
Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a~single machine
p. 78-90