Geodesic

Sommaire du Fascicule no. 1

On reconstructive sets of vertices in the Boolean cube
p. 3-16
Approximation algorithms for maximum-weight problem of two-peripatetic salesmen
p. 17-32
About the reliability of nonbranching programs in the basis of a~generalized conjunction
p. 33-40
Enumeration of bent functions on the minimal distance from the quadratic bent function
p. 41-58
Lower and upper bounds for the optimal makespan in the multimedia problem
p. 59-73
The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
p. 74-96

Sommaire du Fascicule no. 2

Decidability conditions for problems about automata reading infinite words
p. 3-18
Tabu search for the discrete (r|p)-centroid problem
p. 19-40
Genetic algorithm with tournament selection as a~local search method
p. 41-53
On a two-machine routing open shop problem on a~two-node network
p. 54-74
Construction of Hamiltonian cycles with a~given range of directions of edges in the Boolean n-dimensional cube
p. 75-83
On the admissible families of components of Hamming codes
p. 84-91
Approximation scheme for one problem of a~vector subset choice
p. 92-100

Sommaire du Fascicule no. 3

The computation complexity in the class of formulas
p. 3-12
On complexity of optimal recombination for one scheduling problem with setup times
p. 13-26
Approximation algorithms for some NP-hard problems of searching a~vectors subsequence
p. 27-38
On minimal realizations of linear Boolean functions
p. 39-57
Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique
p. 58-64
Preemptive routing open shop on a~link
p. 65-78
On minimal complexes of faces in the unit cube
p. 79-99

Sommaire du Fascicule no. 4

K\"onig graphs with respect to 3-paths
p. 3-14
On existence of Walras equilibrium in a~multi-regional economic model
p. 15-34
Multicoloring of incidentors of weighted undirected multigraph
p. 35-47
A formula for the number of labeled connected graphs
p. 48-59
Perfect multiple coverings of hypercube
p. 60-65
Polynomial solvability of the independent set problem for one class of graphs with small diameter
p. 66-72
Affine nonsystematic codes
p. 73-85
On solutions to systems of automata-type functional equations
p. 86-98

Sommaire du Fascicule no. 5

Minimal in terms of double-sided shadow subsets of Boolean cube layer distinct from circles
p. 3-20
Running time of local search algorithms for a~scheduling problem on the parallel machines
p. 21-34
On an upper bound for the cardinality of a~minimal teaching set of a~threshold function
p. 35-46
Steiner quadruple systems of small rank embedded into extended perfect binary codes
p. 47-62
Variable neighborhood search for two machine flowshop problem with a~passive prefetch
p. 63-82
The pricing problem. Part~I. Exact and approximate algorithms
p. 83-100

Sommaire du Fascicule no. 6

On reconstruction of a~binary code from dimensions of its subcodes
p. 3-8
Effective algorithm for solving a~two-level facility location problem on a~tree-like network
p. 9-22
Stability analysis of Pareto optimal portfolio of multicriteria investment problem with Wald's maximin criteria
p. 23-36
Study of boundary graph classes for colorability problems
p. 37-48
The Shannon function of computation of the Arnold complexity of length 2n binary words
p. 49-55
The pricing problem. Part~2. The computational complexity
p. 56-71
Decomposition of underdetermined data
p. 72-98