RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

2012, Volume 19, Issue 5


Minimal in terms of double-sided shadow subsets of Boolean cube layer distinct from circles
M. A. Bashov
3
Running time of local search algorithms for a scheduling problem on the parallel machines
Yu. Yu. Velikanova
21
On an upper bound for the cardinality of a minimal teaching set of a threshold function
N. Yu. Zolotykh, A. Yu. Chirkov
35
Steiner quadruple systems of small rank embedded into extended perfect binary codes
D. I. Kovalevskaya, F. I. Solov'eva
47
Variable neighborhood search for two machine flowshop problem with a passive prefetch
P. A. Kononova, Yu. A. Kochetov
63
The pricing problem. Part I. Exact and approximate algorithms
A. V. Plyasunov, A. A. Panin
83


© Steklov Math. Inst. of RAS, 2026