Quadratic assignment problem

Known as: QAP 
The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2017
02040608019742017

Related topics

Related topics

21 relations
AlgorithmAnt colony optimization algorithmsAssignment problemBranch and bound
(More)

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
Quadratic assignment problem
Algorithm
Loss function
Integrated circuit
Combinatorial optimization
Printed circuit board

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Quadratic Assignment Problem
This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Iterated local search for the quadratic assignment problem
Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for nding high quality… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A greedy genetic algorithm for the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse… (More)
  • figure 2
  • figure 3
  • table 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Ant System Applied to the Quadratic Assignment Problem
In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Comparison of Iterative Searches for the Quadratic Assignment Problem
This paper compares some of the most efficient heuristic methods for the quadratic assignment problem. These methods are known as… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
Semideenite programming(SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
QAPLIB - A Quadratic Assignment Problem Library
The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization. It is still… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Ant Colonies for the Quadratic Assignment Problem
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A genetic approach to the quadratic assignment problem
Scope and Purpose There are a vast number of practical design and resource-allocation problems, in many different fields, where… (More)
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Genetic Hybrids for the Quadratic Assignment Problem
A new hybrid procedure that combines genetic operators to existing heuristics is proposed to solve the Quadratic Assignment… (More)
Is this relevant?