RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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


2017, Volume 24, Number 4  


An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
V. L. Beresnev, A. A. Melnikov
5
Lattice complete graphs
Yu. E. Bessonov, A. A. Dobrynin
22
On $(1,l)$-coloring of incidentors of multigraphs
M. O. Golovachev, A. V. Pyatkin
34
On computational complexity of the electric power flow optimization problem in market environment
A. V. Eremeev
47
On the operations of bounded suffix summation and multiplication
S. S. Marchenkov
60
The network equilibrium problem with mixed demand
O. V. Pinyagina
77
On facet-inducing inequalities for combinatorial polytopes
R. Yu. Simanchev
95
An exact algorithm for finding a vector subset with the longest sum
V. V. Shenmaier
111
To the memory of Vadim Georgievich Vizing
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018