A survey for the quadratic assignment problem

By Eliane Maria Loiola, N. Abreu, P. O. Netto, P. Hahn, T. Querido. European Journal of Operational Research, 2007

447 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Three-level AHP-based heuristic approach for a multi-objective facility layout problem (2011, background): “…online 2011 Taylor & Francis DOI: 10.1080/00207540903536148 http://www.informaworld.com formulation used frequently to solve FLP. Comparative reviews on FLP can be found in Kusiak and Heragu (1987), Singh and Sharma (2006), Drira et al. (2007), Loiola et al. (2007) and Singh and Singh (2010).”
Quantum computing for energy systems optimization: Challenges and opportunities (2019, unknown): “12 in this problem [46].”
On pairwise costs for network flow multi-object tracking (2014, background): “While in such a case obtaining the global optimum is NP-hard [18], we outline an approach to obtain near optimum solutions, while we empirically verify its optimality.”
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement (2010, methodology): “Although various methods for solving QAP have been proposed [16], there is a general agreement that finding the optimality of QAP problems with size > 15 is practically impossible.”
Image Matching from Handcrafted to Deep Features: A Survey (2020, background): “Although different forms exist in the literature, the main body of research has focused on the Lawler’s QAP (Lawler 1963).”
A Survey of the Quadratic Assignment Problem (2014, unknown): “optimal solution p=[2,4,5,3,1] .”