Geodesic

Sommaire du Fascicule no. 1

The enumerative properties of combinatorial partition polynomials
p. 3-14
Some properties of well-based sequences
p. 15-19
On a~polinomial solving case of decentralized transportation problem
p. 20-26
The complexity of optimal recombination for the traveling salesman problem
p. 27-40
Approximation algorithms for graph approximation problems
p. 41-60
The approximation algorithm for one problem of searching for subset of vectors
p. 61-69
Minimal hard classes of graphs for the edge list-ranking problem
p. 70-76
On an extremal family of circulant networks
p. 77-84
Scheduling unit-time jobs on parallel processors polytope
p. 85-97

Sommaire du Fascicule no. 2

Perfect 2-colorings of transitive cubic graphs
p. 3-17
2-distance 4-coloring of planar subcubic graphs
p. 18-28
An approximation algorithm for one problem of cluster analysis
p. 29-40
Stability radius bounds for the lexicographic optimum of the vector Boolean problem with Savage's risk criteria
p. 41-50
On reduction of key space of the cipher A5/1 and on reversibility of the next-state function for a~stream generator
p. 51-63
Optimal Eulerian coverings with ordered enclosing for plane graphs
p. 64-74
On kernel and shortest complexes of faces in the unit cube
p. 75-94

Sommaire du Fascicule no. 3

Distance regular colorings of the infinite rectangular grid
p. 3-10
Probabilistic analysis of decentralized version of оne generalization of the assignment problem
p. 11-20
Research of applying bounds of the information protection scheme based on PS-codes
p. 21-38
Discrete dynamical systems of a~circulant type with linear functions at vertices of network
p. 39-48
Bounds on average number of iterations of the algorithms for solving some Boolean programming problems
p. 49-64
Cycles of functioning of regulatory circuits of the gene network discrete models
p. 65-75
SAT polytopes are faces of polytopes of the traveling salesman problem
p. 76-83
Analysis of the number of the edges effect on the complexity of the independent set problem solvability
p. 84-88

Sommaire du Fascicule no. 4

Local search over generalized neighborhood for an optimization problem of pseudo-Boolean functions
p. 3-16
Polynomial algorithm with approximation ratio 7/9 for maximum 2-PSP
p. 17-48
Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks
p. 49-65
On classificatons of many-valued logic functions by means of automorphism groups
p. 66-76
On a~generalization of N-nucleolus in cooperative games
p. 77-93

Sommaire du Fascicule no. 5

Multicriterial graph problems with MAXMIN criterion
p. 3-10
An approximation algorithm for the minimum 2-PSP with different weight functions valued~1 and~2
p. 11-37
Thin circulant matrixes and lower bounds on complexity of some Boolean operators
p. 38-53
On scheduling with technology based machines grouping
p. 54-79
About finding of maximal subclones in weak-central clone
p. 80-97

Sommaire du Fascicule no. 6

On stability radius of effective solution of vector quadratic boolean bottleneck problem
p. 3-16
On maximization of sensor network's lifetime subject to the limited resources
p. 17-32
Cycles of lentgth~9 in the Pancake graph
p. 33-60
Boundary classes for the list-ranking problems in subclasses of forests
p. 61-70
On distributed circuits
p. 71-81
On the parameters of perfect 2-colorings of circulant graphs
p. 82-89