Geodesic

Issue no. 23 Table of Contents

Complexity of problems of minimization of polynomials in Boolean variables
p. 3-11
An efficient algorithm for solution of a distribution problem with servicing areas that are connected in relation to an acyclic network
p. 12-23
Problem of the calendar planning of a large-scale design under the conditions of limited resources: experience in the construction of software
p. 24-32
Minimization of a convex separable function on an intersection of polymatroids
p. 33-43
A problem of construction of an optimal tree
p. 44-54
Completely regular truncations in Boolean programming
p. 55-63
Lower bound for the number of iterations for a class of truncation algorithms
p. 64-69
The Akers–Friedman problem
p. 70-81