Subset quadratic assignment problem

Authors:
He Jiang;Yan Hu
Affiliations:
-;-
Venue:
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Year:
2012

Citing 9
Cited 1

Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn

Information Processing Letters
P-Complete Approximation Problems

Journal of the ACM (JACM)
Wireless integrated network sensors

Communications of the ACM
A deterministic annealing algorithm for a combinatorial optimization problem using replicator equations

Physica D
Best reduction of the quadratic semi-assignment problem

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Selected topics on assignment problems

Discrete Applied Mathematics
A New Genetic Algorithm for the Quadratic Assignment Problem

INFORMS Journal on Computing
Solving the quadratic assignment problem with clues from nature

IEEE Transactions on Neural Networks

Using simulation in hospital layout planning

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Variants of QAP have become the hot lines in research on NP-Hard combinatorial optimization problems. There exists a new kind of problem which can't be modeled as QAP or its existing variants, in applications such as hospital layout whose facility must be assigned to one location in some predefined subset. This new problem is modeled as the subset QAP (SQAP) in this paper. We show that SQAP is NP-Hard and no ε --- approximation algorithm exists for it (ε0). Furthermore, we prove that it can be determined in polynomial time whether a feasible solution exists or not, by proving its equivalence to perfect matching problem on bipartite graph.