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. 6
Précédent
Suivant
Sommaire
Bounds on the cardinality of a~minimal
1
-perfect bitrade in the Hamming graph
K. V. Vorob'ev
;
D. S. Krotov
p. 3-10
2
/
3
-approximation algorithm for the maximization version of the asymmetric two peripatetic salesman problem
A. N. Glebov
;
D. Zh. Zambalaeva
;
A. A. Skretneva
p. 11-20
Local search with exponential neighborhood for the servers load balancing problem
I. A. Davydov
;
P. A. Kononova
;
Yu. A. Kochetov
p. 21-34
Evolutionary-fragmentary model of pentamino packing
I. V. Kozin
;
S. I. Polyuga
p. 35-50
Improvement of complexity bounds of monomials and sets of powers computations in Bellman's and Knuth's problems
V. V. Kochergin
p. 51-72
Estimates for lengths of check and diagnostic tests of functional elements
K. A. Popkov
p. 73-89