|
Avtomatika i Telemekhanika, 2016, Issue 11, Pages 18–42
(Mi at14595)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Topical issue
Multi-index transportation problems with $1$-nested structure
L. G. Afraimovich, A. S. Katerov, M. Kh. Prilutskii Lobachevsky State University, Nizhny Novgorod, Russia
Abstract:
Consideration was given to the solution of the multi-index transportation problems of linear and integer-linear programming. It was proposed to use the approach based on studying the reducibility of the multi-index transportation problems to the problem of the minimal cost in the treelike network. It was proved that within the framework of the reduction scheme the condition for $1$-nesting of the multi-index problems is necessary and sufficient for reducibility to the problem of the minimal-cost flow problem on a treelike network. An algorithm was proposed to solve the $1$-nested multi-index problems requiring as many computer operations as the square of variables in the original problem.
Citation:
L. G. Afraimovich, A. S. Katerov, M. Kh. Prilutskii, “Multi-index transportation problems with $1$-nested structure”, Avtomat. i Telemekh., 2016, no. 11, 18–42; Autom. Remote Control, 77:11 (2016), 1894–1913
Linking options:
https://www.mathnet.ru/eng/at14595 https://www.mathnet.ru/eng/at/y2016/i11/p18
|
Statistics & downloads: |
Abstract page: | 180 | Full-text PDF : | 47 | References: | 36 | First page: | 11 |
|