Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnyj analiz i issledovanie operacij
Tome 21 (2014)
no. 2
Précédent
Suivant
Sommaire
Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers
V. L. Beresnev
;
A. A. Melnikov
p. 3-23
The number of labeled block-cactus graphs
V. A. Voblyi
;
A. K. Meleshko
p. 24-32
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
p. 33-51
A threshold property of quadratic Boolean functions
N. A. Kolomeec
p. 52-58
The Shannon function for calculating the Arnold complexity of length
2
n
binary words for arbitrary~
n
Yu. V. Merekin
p. 59-75
Perfect
2
-colorings of infinite circulant graphs with a~continuous set of distances
O. G. Parshina
p. 76-83
Polyhedral complementarity algorithms for searching an equilibrium in linear models of competitive economy
V. I. Shmyrev
p. 84-101