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. 4
Précédent
Suivant
Sommaire
Complexity of the Euclidean max cut problem
A. A. Ageev
;
A. V. Kel'manov
;
A. V. Pyatkin
p. 3-11
On reliability of circuits realizing ternary logic functions
M. A. Alekhina
;
O. Yu. Barsukova
p. 12-24
Discrete dynamical systems with threshold functions at the vertices
Ts. Ch.-D. Batueva
p. 25-32
On multicoloring of incidentors of a~weighted oriented multigraph
V. G. Vizing
p. 33-41
Probabilistic analysis of one routing problem
A. M. Istomin
p. 42-53
Affine
3
-nonsystematic codes
S. A. Malyugin
p. 54-61
Computational complexity of the discrete competitive facility location problem
A. A. Mel'nikov
p. 62-79
A~discrete dynamical system on a~double circulant
A. M. Nazhmidenova
;
A. L. Perezhogin
p. 80-88
Integer models for the interrupt-oriented services of jobs by single machine
R. Yu. Simanchev
;
N. Yu. Shereshik
p. 89-101