|
|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2006, Volume 46, Number 2, Pages 222–228
(Mi zvmmf516)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Investigation of polynomial algorithms for solving the three-index planar assignment problem
S. A. Dichkovskaya, M. K. Kravtsov Economics Research Institute, Ministry for Economics of the Republic of Belarus, ul. Slavinskogo 1, korp. 1, Minsk, 220086, Belarus
Abstract:
Under certain additional conditions imposed on the coefficients of the objective function in the three-index planar assignment problem, a large series of computational experiments aimed at the investigation of four polynomial algorithms for finding an asymptotically optimal solution of this problem is conducted.
Key words:
planar assignment problem, asymptotically optimal algorithms, computational experiments.
Received: 08.04.2005 Revised: 05.09.2005
Citation:
S. A. Dichkovskaya, M. K. Kravtsov, “Investigation of polynomial algorithms for solving the three-index planar assignment problem”, Zh. Vychisl. Mat. Mat. Fiz., 46:2 (2006), 222–228; Comput. Math. Math. Phys., 46:2 (2006), 212–217
Linking options:
https://www.mathnet.ru/eng/zvmmf516 https://www.mathnet.ru/eng/zvmmf/v46/i2/p222
|
|