Geodesic

Sommaire du Fascicule no. 1

Global optimization and methods for finding all the roots of systems of nonlinear algebraic equations
p. 3-9
An asymptotically exact algorithm for one modification of planar three-index assignment
p. 10-26
Approximation solution of the supply management problem
p. 27-39
The branch and bound method for a~quadratic problem of bilevel programming
p. 40-56
A scheme of approximation solution of problem 1|Rj|Lmax
p. 57-76
A modification of the Fourier--Motskin algorithm for constructing a~triangulation and its star coloring
p. 77-94

Sommaire du Fascicule no. 2

An approximate algorithm for finding a maximum-weight d-homogeneous connected spanning subgraph in a~complete graph with random edge weights
p. 3-20
An algorithm for the formation of a~hierarchical system of invariants of isomorphisms of mappings of finite sets
p. 21-30
By-passes with ordered enclosing in planar graphs
p. 31-43
A polynomially solvable case of the three-stage Johnson problem
p. 44-55
On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality
p. 56-73
A generalized linear exchange model
p. 74-102

Sommaire du Fascicule no. 3

Certain generalization of the maximum traveling salesman problem
p. 3-12
Polynomial operator representations of functions of k-valued logic
p. 13-26
A criterion for positive completeness in ternary logic
p. 27-39
Conditions for realization of a~function on a~semilattice over real bases of switching elements
p. 40-61
A completeness theorem in the class of quasimonotonic functions
p. 62-82
Some properties of optimal schedules for the Johnson problem with preemption
p. 83-102

Sommaire du Fascicule no. 4

On schemes that are asymptotically best with respect to reliability in the basis
p. 3-17
On bounds for the incidentor chromatic number of a~directed weighted multigraph
p. 18-25
On the weak isometries of the Boolean cube
p. 26-32
Superpositions of elementary arithmetic functions
p. 33-48
A lower bound for the number of transitive perfect codes
p. 49-59
A survey of methods for constructing nonlinear perfect binary codes
p. 60-88
On the complexity of a~cyclic shift of a~set of real numbers
p. 89-92