Geodesic

Sommaire

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