|
|
|
Publications in Math-Net.Ru |
Citations |
|
2011 |
| 1. |
E. Kh. Gimadi, V. T. Dementev, “Probabilistic analysis of decentralized version of оne generalization of the assignment problem”, Diskretn. Anal. Issled. Oper., 18:3 (2011), 11–20    |
| 2. |
V. T. Dementiev, Yu. V. Shamardin, “On a polinomial solving case of decentralized transportation problem”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 20–26 |
1
|
|
2008 |
| 3. |
V. T. Dement'ev, A. V. Pyatkin, “On decentralized transportation problem”, Diskretn. Anal. Issled. Oper., 15:3 (2008), 22–30 ; J. Appl. Industr. Math., 3:1 (2009), 32–37  |
3
|
|
2003 |
| 4. |
V. T. Dement'ev, Yu. V. Shamardin, “A two-level assignment problem with a generalized Monge condition”, Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003), 19–28 |
|
2002 |
| 5. |
V. T. Dement'ev, Yu. V. Shamardin, “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 |
3
|
|
2001 |
| 6. |
V. T. Dement'ev, Yu. V. Shamardin, “A three-level model for the choice of nomenclature of products”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:1 (2001), 40–46 |
|
1999 |
| 7. |
L. Y. Gorbachevskaya, V. T. Dement'ev, Yu. V. Shamardin, “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 |
6
|
|
1994 |
| 8. |
A. I. Gladyshev, V. T. Dement'ev, A. I. Erzin, “Models and problems of the optimal synthesis of homogeneous hierarchical systems”, Trudy Inst. Mat. SO RAN, 28 (1994), 63–76 |
|
1974 |
| 9. |
E. Kh. Gimadi, N. I. Glebov, V. T. Dement'ev, “On a method of constructing a lower estimate and an approximate solution with an aposteriori exactness estimation for a standardization problem”, Upravliaemie systemy, 1974, no. 13, 26–31 |
|
1971 |
| 10. |
N. I. Glebov, V. T. Dement'ev, A. N. Sychev, “О динамике развития однородных технических систем”, Upravliaemie systemy, 1971, no. 8, 51–67 |
|
| Organisations |
|
| |
|
|
Contact us: