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 12 (2005)
Précédent
Suivant
Sommaire du
Fascicule no. 1
An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
V. L. Beresnev
p. 3-11
New greedy heuristics for the scheduling problem with limited resources
Yu. A. Kochetov
;
A. A. Stolyar
p. 12-36
Perfect colorings of vertices of the graph
G
(
Z
2
)
in three colors
S. A. Puzynina
p. 37-54
On a model of the optimal distribution of an indivisible resource
E. O. Rapoport
p. 55-73
Existence of an equilibrium in a one-period model of an economy with investment
A. V. Sidorov
p. 74-96
Sommaire du
Fascicule no. 2
Optimal matrix correction of incompatible systems of linear algebraic equations with block matrices of coefficients
V. A. Gorelik
;
V. I. Erokhin
;
R. V. Pechenkin
p. 3-23
Analysis of the sensitivity of an efficient solution of a vector Boolean problem of the minimization of projections of linear functions onto
R
+
and
R
−
V. A. Emelichev
;
K. G. Kuz'min
p. 24-43
On the complexity of local search in the
p
-median problem
Yu. A. Kochetov
;
M. G. Pashchenko
;
A. V. Plyasunov
p. 44-71
On a multicriterial problem of integer linear programming
A. Yu. Chirkov
;
V. N. Shevchenko
;
N. Yu. Zolotykh
p. 72-84
Some cases of the polynomial solvability of the problem of price selection for production
Yu. V. Shamardin
p. 85-96
Sommaire du
Fascicule no. 3
On the properties of a stochastic context-free language generated by a grammar with two classes of nonterminal symbols
A. E. Borisov
p. 3-31
Sufficient conditions for the 2-distance
(
Δ
+
1
)
-colorability of planar graphs with girth 6
O. V. Borodin
;
A. O. Ivanova
;
T. K. Neustroeva
p. 32-47
Strict coloring of incidentors in undirected multigraphs
V. G. Vizing
p. 48-53
On the largest dimension of anticodes
A. J. van Zanten
p. 54-59
The number of
k
-nonseparated families of subsets of an
n
-element set (
k
-nonseparated Boolean functions of
n
-variables). III. The case of
k
≥
3
and arbitrary
n
A. D. Korshunov
p. 60-73
Variety of balls in metric spaces of trees
T. I. Fedoryaeva
p. 74-84
Transformation of fuzzy data with preservation of the information properties
L. A. Sholomov
p. 85-104
Sommaire du
Fascicule no. 4
On graphs without 3-claws with non-clique
μ
-subgraphs
I. A. Vakula
;
V. V. Kabanov
p. 3-22
On the
(
p
,
q
)
-coloring of incidentors of an undirected multigraph
V. G. Vizing
p. 23-39
On the additive complexity of partially commutative words
Yu. V. Merekin
p. 40-50
On special perfect matchings in a Boolean cube
A. L. Perezhogin
p. 51-59
Estimates for the accuracy of solutions of discrete convex optimization problems obtained by a coordinatewise lifting algorithm
A. B. Ramazanov
p. 60-80
Numerical solution of special problems of nonconvex quadratic programming
O. V. Khamisov
p. 81-91
New books for discrete mathematics
A. D. Korshunov
p. 95-97