1983, Issue 23

Operations Research Extreme Challenges

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