| Article ID: | iaor2012905 |
| Volume: | 73 |
| Issue: | 2 |
| Start Page Number: | 336 |
| End Page Number: | 348 |
| Publication Date: | Feb 2012 |
| Journal: | Automation and Remote Control |
| Authors: | Zabudskii G, Lagzdin A |
| Keywords: | programming: dynamic |
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.