Dynamic programming for the quadratic assignment problem on trees

Authors:
G. G. Zabudskii;A. Yu. Lagzdin
Affiliations:
Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia;Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2012

Citing 6
Cited 0

The optimal distribution of a tree in a finite set

USSR Computational Mathematics and Mathematical Physics
Approximating the maximum quadratic assignment problem

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Lower Bounds for the Quadratic Assignment Problem

Automation and Remote Control
Assignment Problems

Assignment Problems
Approximating the minimum quadratic assignment problems

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

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.