|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 1, Pages 20–26
(Mi da635)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On a polinomial solving case of decentralized transportation problem
V. T. Dementievab, Yu. V. Shamardina a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
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.
Received: 08.09.2010
Citation:
V. T. Dementiev, Yu. V. Shamardin, “On a polinomial solving case of decentralized transportation problem”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 20–26
Linking options:
https://www.mathnet.ru/eng/da635 https://www.mathnet.ru/eng/da/v18/i1/p20
|
Statistics & downloads: |
Abstract page: | 416 | Full-text PDF : | 94 | References: | 68 | First page: | 18 |
|