|
Avtomatika i Telemekhanika, 2012, Issue 2, Pages 141–155
(Mi at3617)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Integer Programming Problems
Dynamic programming for the quadratic assignment problem on trees
G. G. Zabudskii, A. Yu. Lagzdin Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia
Abstract:
We consider the quadratic assignment problem in terms of graph theory. To solve it on a tree-like network, we present both sequential and parallel dynamic programming algorithms. We also present the results of numerical comparison of our algorithms with the IBM ILOG CPLEX suite.
Citation:
G. G. Zabudskii, A. Yu. Lagzdin, “Dynamic programming for the quadratic assignment problem on trees”, Avtomat. i Telemekh., 2012, no. 2, 141–155; Autom. Remote Control, 73:2 (2012), 336–348
Linking options:
https://www.mathnet.ru/eng/at3617 https://www.mathnet.ru/eng/at/y2012/i2/p141
|
Statistics & downloads: |
Abstract page: | 715 | Full-text PDF : | 345 | References: | 46 | First page: | 45 |
|