Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two… 
2007
2007
Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. But… 
2002
2002
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search… 
2000
2000
The quadratic assignment problem (QAP) is the problem of finding an assignment of an equal number of facilities to locations that… 
2000
2000
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment… 
1995
1995
The quadratic assignment problem (QAP) is among the most commonly encountered combinatorial optimization problems. Recently… 
1995
1995
The Hopfield neural network is proposed as a method for solving the Quadratic Assignment Problem. The study involves determining… 
1986
1986
  • F. Rendl
  • 1986
  • Corpus ID: 37617090
Christofides has shown that the quadratic assignment problem (QAP) on isomorphic trees is solvable in polynomial time by dynamic… 
1980
1980
A new algorithm for solving quadratic assignment problems is presented. The algorithm, which employs a sequential search…