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


2014, Volume 21, Number 2  


Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers
V. L. Beresnev, A. A. Melnikov
3
The number of labeled block-cactus graphs
V. A. Voblyi, A. K. Meleshko
24
A partition of a planar graph with girth 6 into two forests containing no path of length greater than 4
A. N. Glebov, D. Zh. Zambalaeva
33
A threshold property of quadratic Boolean functions
N. A. Kolomeec
52
The Shannon function for calculating the Arnold complexity of length $2^n$ binary words for arbitrary $n$
Yu. V. Merekin
59
Perfect $2$-colorings of infinite circulant graphs with a continuous set of distances
O. G. Parshina
76
Polyhedral complementarity algorithms for searching an equilibrium in linear models of competitive economy
V. I. Shmyrev
84
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020