• Corpus ID: 56226900

Quadratic Assignment Problems (QAP) and Its Size Reduction Method

@article{Choi2003QuadraticAP,
  title={Quadratic Assignment Problems (QAP) and Its Size Reduction Method},
  author={Da-Som Choi},
  journal={Rose–Hulman Undergraduate Mathematics Journal},
  year={2003},
  volume={4},
  pages={7},
  url={https://api.semanticscholar.org/CorpusID:56226900}
}
  • Da-Som Choi
  • Published 2003
  • Mathematics
  • Rose–Hulman Undergraduate Mathematics Journal
The Quadratic Assignment Problem (QAP) is a discrete optimization problem which can be found in economics, operations research, and engineering. It seeks to locate N facilities among N fixed locations in the most economical way. This paper gives a brief introduction to QAP and discusses how to reduce the problem size to N-1 if the original problem satisfies certain conditions. 
rose-hulman.edu
2 Citations

2 Citations

Comparative Study between FA, ACO, and PSO Algorithms for Optimizing Quadratic Assignment Problem

This paper compares three such nature inspired algorithms; firefly, particle swarm optimization and ant colony optimization algorithm for optimizing Quadratic Assignment Problem.

Metode Reduksi Ukuran Pada Masalah Penugasan Kuadratik Simetris (Size Reduction Method Over Simmetric Quadratic Assignment Problem (Sqap))

Masalah penugasan kuadratik simetris (SQAP) merupakan suatu optimisasi masalah penugasan N fasilitas ke N lokasi, dengan setiap (i , k ) fasilitas akan ditugaskan pada ( j , n) lokasi, i, j , k , n…

3 References

Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation

A new bounding procedure for the Quadratic Assignment Problem (QAP) is described which extends the Hungarian method for the Linear Assignment Problem (LAP) to QAPs, operating on the four dimensional…

A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

TREE ELABORATION STRATEGIES IN BRANCH-AND- BOUND ALGORITHMS FOR SOLVING THE QUADRATIC ASSIGNMENT PROBLEM

A new strategy for selecting nodes in a branch-and-bound algorithm for solving exactly the Quadratic Assignment Problem (QAP) is presented and the performance of the four most successful algorithms for exact solution of the QAP is compared.