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


2015, Volume 22, Number 4  


Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded from below
E. Kh. Gimadi, E. Yu. Shin
5
About density of a covering of a strip with identical sectors
A. I. Erzin, N. A. Shabelnikova
21
The complexity of the project scheduling problem with credits
E. A. Kazakovtseva, V. V. Servakh
35
An exact pseudopolynomial algorithm for a bi-partitioning problem
A. V. Kel'manov, V. I. Khandeev
50
Effective algorithms for one scheduling problem on two machines with makespan minimization
A. A. Romanova
63
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020