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


2016, Volume 23, Issue 2  


Enumeration of labeled connected graphs with given order and number of edges
V. A. Voblyi
5
Fully polynomial-time approximation scheme for a sequence $2$-clustering problem
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev
21
On complexity of optimal recombination for flowshop scheduling problems
Yu. V. Kovalenko
41
Network flow assignment as a fixed point problem
A. Yu. Krylatov
63
On the maximal component algebraic immunity of vectorial Boolean functions
D. P. Pokrasenko
88
Comparative study of two fast algorithms for projecting a point to the standard simplex
G. Sh. Tamasyan, E. V. Prosolupov, T. A. Angelov
100
On the jubilee of A. D. Korshunov
124
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021