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 9 (2002)
Précédent
Suivant
Sommaire du
Fascicule no. 1
A European option with an arbitrary number of types of risk securities in the discrete time case
N. S. Demin
;
M. Yu. Shishirin
p. 3-20
On the parametrization of the optimality principle in a criterion space
V. A. Emelichev
;
A. V. Pashkevich
p. 21-32
Properties of optimal single-rank correction of matrices of coefficients of inconsistent nonhomogeneous linear models
V. I. Erokhin
p. 33-60
Stochastic models for price prediction
A. N. Katulev
;
An. N. Sotnikov
p. 61-77
New algorithms for solving linear programming problems with a special structure
M. V. Pudova
p. 78-98
Sommaire du
Fascicule no. 2
On conditions for the solvability of optimization problems by a greedy algorithm
N. I. Glebov
p. 3-12
Probabilistic search with exclusions for discrete unconstrained optimization
E. N. Goncharov
;
Yu. A. Kochetov
p. 13-30
The problem of price selection for production under the condition of obligatory satisfaction of demand
V. T. Dement'ev
;
Yu. V. Shamardin
p. 31-40
Optimal matrix correction and regularization of incompatible linear models
V. I. Erokhin
p. 41-77
The problem of the choice of a series of goods with partial external financing
Yu. A. Kochetov
;
A. V. Plyasunov
p. 78-96
Probabilistic approximate algorithms in discrete optimization
N. N. Kuzyurin
p. 97-114
Sommaire du
Fascicule no. 3
Lower bounds for the reliability of schemes in some bases with single-type constant faults at the inputs of the elements
M. A. Alekhina
p. 3-28
Strengthening Lebesgue's theorem on the structure of the minor faces in convex polyhedra
O. V. Borodin
p. 29-39
Fast cellular schemes for multiplication
D. A. Zhukov
p. 40-47
Efficient diagnosis of faults in automaton networks
V. N. Noskov
p. 48-74
Sommaire du
Fascicule no. 4
On the completeness of systems of monotone functions for the realization of quasi-monotone functions on finite semilattices
G. P. Agibalov
;
N. G. Parvatov
p. 5-22
On the asymptotic accuracy of an algorithm for solving the traveling salesman problem for a maximum in a Euclidean space
A. E. Baburin
;
E. Kh. Gimadi
p. 23-32
Strong distance invariance of perfect binary codes
A. Yu. Vasil'eva
p. 33-40
Monotone Boolean polynomials
M. N. Vyalyi
;
V. K. Leont'ev
;
M. V. Osetrov
p. 41-49
On the complexity of one-dimensional universal cellular automata
I. I. Zakharchuk
p. 50-56
On invariant classes of functions that are repetition-free expressible by formulas
D. Yu. Cherukhin
p. 57-74
Analysis of coordinate-wise lifting algorithms for polymatroids
V. V. Shenmaier
p. 75-81
Complexity of the recognition of the properties of order relations in
n
-dimensional spaces
L. A. Sholomov
p. 82-105
New books for discrete mathematics
A. D. Korshunov
p. 108-110