Geodesic

Sommaire du Fascicule no. 1

Separation of words by positions of subwords
p. 3-14
The probabilistic analysis of an algorithm for solving the $m$-planar $3$-dimensional assignment problem on one-cycle permutations
p. 15-29
On upper bound of non-branching programs unreliability at one-type constant faults on the computational operators outputs
p. 30-43
On the description problem of the diversity vectors of balls
p. 44-52
Approximation algorithm for one problem of partitioning a~sequence
p. 53-66
Positive closed classes in the three-valued logic
p. 67-83
On some problems of covering the plane with circles
p. 84-102

Sommaire du Fascicule no. 2

Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers
p. 3-23
The number of labeled block-cactus graphs
p. 24-32
A partition of a~planar graph with girth~6 into two forests containing no path of length greater than~4
p. 33-51
A threshold property of quadratic Boolean functions
p. 52-58
The Shannon function for calculating the Arnold complexity of length $2^n$ binary words for arbitrary~$n$
p. 59-75
Perfect $2$-colorings of infinite circulant graphs with a~continuous set of distances
p. 76-83
Polyhedral complementarity algorithms for searching an equilibrium in linear models of competitive economy
p. 84-101

Sommaire du Fascicule no. 3

DOOR-2013
On the calculation of rent estimates
p. 4-10
A stochastic greedy algorithm for the resource-constrained project scheduling problem
p. 11-24
Analysis of discrete automaton models of gene networks with irregular structure using symbolic algorithms
p. 25-40
FPTAS for solving a~problem of search for a~vector subset
p. 41-52
Stability of compatible systems of linear inequalities and linear separability
p. 53-63
An exact algorithm for solving the discrete Weber problem for a~$k$-tree
p. 64-75
On edge muticoloring of unicyclic graphs
p. 76-81
Polytopes and connected subgraphs
p. 82-86
Finding the distance between the ellipsoids
p. 87-102

Sommaire du Fascicule no. 4

Complexity of the Euclidean max cut problem
p. 3-11
On reliability of circuits realizing ternary logic functions
p. 12-24
Discrete dynamical systems with threshold functions at the vertices
p. 25-32
On multicoloring of incidentors of a~weighted oriented multigraph
p. 33-41
Probabilistic analysis of one routing problem
p. 42-53
Affine $3$-nonsystematic codes
p. 54-61
Computational complexity of the discrete competitive facility location problem
p. 62-79
A~discrete dynamical system on a~double circulant
p. 80-88
Integer models for the interrupt-oriented services of jobs by single machine
p. 89-101

Sommaire du Fascicule no. 5

$3$-regular subgraphs and $(3,1)$-colorings of $4$-regular pseudographs
p. 3-16
Enumeration of labeled Eulerian tetracyclic graphs
p. 17-22
Capacitated facility location problem on random input data
p. 23-39
Numerical search of equilibrium in Cournot model with $S$-like costs functions
p. 40-53
On complexity of bilevel problems of location and pricing
p. 54-66
On algebraic immunity of Dillon's bent functions
p. 67-75
Minimal complexes of faces of a~random Boolean function
p. 76-94
Letter to the Editor

Sommaire du Fascicule no. 6

Bounds on the cardinality of a~minimal $1$-perfect bitrade in the Hamming graph
p. 3-10
$2/3$-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem
p. 11-20
Local search with exponential neighborhood for the servers load balancing problem
p. 21-34
Evolutionary-fragmentary model of pentamino packing
p. 35-50
Improvement of complexity bounds of monomials and sets of powers computations in Bellman's and Knuth's problems
p. 51-72
Estimates for lengths of check and diagnostic tests of functional elements
p. 73-89