Geodesic
On a~polinomial solving case of decentralized transportation problem
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 1, pp. 20-26.

Voir la notice de l'article provenant de la source Math-Net.Ru

A case of decentralized transportation problem is considered, where a cost matrix has $n$ lines, $2n$ columns and a diagonal structure. An algorithm based on dynamic programming is proposed, that solves the problem with complexity $O(n^2)$. Bibliogr. 1.
Keywords: decentralized transportation problem, dynamic programming. 
@article{DA_2011_18_1_a2,
     author = {V. T. Dementiev and Yu. V. Shamardin},
     title = {On a~polinomial solving case of decentralized transportation problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {20--26},
     publisher = {mathdoc},
     volume = {18},
     number = {1},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_1_a2/}
}
TY  - JOUR
AU  - V. T. Dementiev
AU  - Yu. V. Shamardin
TI  - On a~polinomial solving case of decentralized transportation problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 20
EP  - 26
VL  - 18
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_1_a2/
LA  - ru
ID  - DA_2011_18_1_a2
ER  - 
%0 Journal Article
%A V. T. Dementiev
%A Yu. V. Shamardin
%T On a~polinomial solving case of decentralized transportation problem
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 20-26
%V 18
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_1_a2/
%G ru
%F DA_2011_18_1_a2
V. T. Dementiev; Yu. V. Shamardin. On a~polinomial solving case of decentralized transportation problem. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 1, pp. 20-26. http://geodesic.mathdoc.fr/item/DA_2011_18_1_a2/

[1] Dementev V. T., Pyatkin A. V., “O detsentralizovannoi transportnoi zadache”, Diskret. analiz i issled. operatsii, 15:3 (2008), 22–30 | MR