|
|
Publications in Math-Net.Ru
-
Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem
Diskretn. Anal. Issled. Oper., 20:1 (2013), 12–27
-
On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 12:2 (2012), 34–40
-
On a polinomial solving case of decentralized transportation problem
Diskretn. Anal. Issled. Oper., 18:1 (2011), 20–26
-
Some cases of the polynomial solvability of the problem of price selection for production
Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005), 85–96
-
A two-level assignment problem with a generalized Monge condition
Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003), 19–28
-
The problem of price selection for production under the condition of obligatory satisfaction of demand
Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002), 31–40
-
A three-level model for the choice of nomenclature of products
Diskretn. Anal. Issled. Oper., Ser. 2, 8:1 (2001), 40–46
-
On a two-level location problem with constraints on the volume of production
Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000), 114–118
-
A two-level standardization problem with the uniqueness condition for the optimal consumption choice
Diskretn. Anal. Issled. Oper., Ser. 2, 6:2 (1999), 3–11
-
On the accuracy of a set-partition algorithm
Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997), 79–87
-
A model for the estimation of the opposition of two coalitions
Diskretn. Anal. Issled. Oper., Ser. 2, 4:1 (1997), 54–64
-
On the accuracy of some algorithms for the loading of a knapsack
Sibirsk. Zh. Issled. Oper., 1:4 (1994), 53–63
-
The optimal attack problem in a linearized formulation
Trudy Inst. Mat. SO RAN, 28 (1994), 118–129
-
The minimax standardization problem in conditions of uncertain demand
Upravliaemie systemy, 1975, no. 14, 59–68
-
On a differential game of quality
Upravliaemie systemy, 1974, no. 12, 73–80
© , 2024