Upravliaemie systemy
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


1983, Issue 23  

Operations Research Extreme Challenges


Complexity of problems of minimization of polynomials in Boolean variables
A. A. Ageev
3
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
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
Minimization of a convex separable function on an intersection of polymatroids
N. I. Glebov
33
A problem of construction of an optimal tree
A. I. Erzin, T. B. Mordvinova
44
Completely regular truncations in Boolean programming
O. A. Zablotskaya, A. A. Kolokolov
55
Lower bound for the number of iterations for a class of truncation algorithms
A. A. Kolokolov
64
The Akers–Friedman problem
V. V. Servakh
70
Diskretnyi Analiz i Issledovanie Operatsii
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021