|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2010, Volume 50, Number 11, Pages 2052–2059
(Mi zvmmf4972)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Polynomial algorithms for solving the quadratic assignment problem on networks
G. G. Zabudskii, A. Yu. Lagzdin Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, ul. Pevtsova 13, Omsk, 644099 Russia
Abstract:
Polynomial algorithms for solving the quadratic assignment problem on special types of networks are proposed. The structure of the links between the objects to be located is represented by a graph.
Key words:
quadratic assignment problem, facility location problem, polynomial algorithms, graphs, networks.
Received: 05.02.2010 Revised: 26.04.2010
Citation:
G. G. Zabudskii, A. Yu. Lagzdin, “Polynomial algorithms for solving the quadratic assignment problem on networks”, Zh. Vychisl. Mat. Mat. Fiz., 50:11 (2010), 2052–2059; Comput. Math. Math. Phys., 50:11 (2010), 1948–1955
Linking options:
https://www.mathnet.ru/eng/zvmmf4972 https://www.mathnet.ru/eng/zvmmf/v50/i11/p2052
|
Statistics & downloads: |
Abstract page: | 526 | Full-text PDF : | 263 | References: | 63 | First page: | 29 |
|