Approximating the minimum quadratic assignment problems
- 28 December 2009
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Algorithms
- Vol. 6 (1), 1-10
- https://doi.org/10.1145/1644015.1644033
Abstract
We consider the well-known minimum quadratic assignment problem. In this problem we are given two n × n nonnegative symmetric matrices A = ( a ij ) and B = ( b ij ). The objective is to compute a permutation π of V = {1,…, n } so that ∑ i , j ∈ V i ≠ j a π( i ),π( j ) b i , j is minimized. We assume that A is a 0/1 incidence matrix of a graph, and that B satisfies the triangle inequality. We analyze the approximability of this class of problems by providing polynomial bounded approximations for some special cases, and inapproximability results for other cases.Keywords
This publication has 20 references indexed in Scilit:
- An improved approximation ratio for the minimum linear arrangement problemInformation Processing Letters, 2007
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problemsMathematical Programming, 2002
- Approximating the maximum quadratic assignment problemInformation Processing Letters, 2001
- Approximation algorithms for minimum tree partitionDiscrete Applied Mathematics, 1998
- Analysis of Christofides' heuristic: Some paths are more difficult than cyclesOperations Research Letters, 1991
- A Combinatorial Optimization Problem Arising in Dartboard DesignJournal of the Operational Research Society, 1991
- Balancing hydraulic turbine runners: A quadratic assignment problemEuropean Journal of Operational Research, 1988
- Hospital Layout as a Quadratic Assignment ProblemJournal of the Operational Research Society, 1977
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- The Backboard Wiring Problem: A Placement AlgorithmSiam Review, 1961