|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2012, Volume 12, Issue 2, Pages 34–40
(Mi vngu117)
|
|
|
|
On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers
R. T. Zaynutdinov, Y. V. Shamardin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
Abstract:
Under study is a particular case of the decentralized transportation problem. Matrices of profits of customers consists of $n$ rows and $kn$ columns and has a block structure. A way of solution is algorithm based on the method of dynamic programming with time complexity $O(k^2n+kn^2)$.
Keywords:
decentralized transportation problem, dynamic programming.
Received: 09.04.2012
Citation:
R. T. Zaynutdinov, Y. V. Shamardin, “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; J. Math. Sci., 198:5 (2014), 648–653
Linking options:
https://www.mathnet.ru/eng/vngu117 https://www.mathnet.ru/eng/vngu/v12/i2/p34
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 64 | References: | 53 | First page: | 3 |
|