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)

Related topics

Related topics

21 relations
AlgorithmAnt colony optimization algorithmsAssignment problemBranch and bound

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
REVISED NOTE ON LEARNING QUADRATIC ASSIGNMENT WITH GRAPH NEURAL NETWORKS
Inverse problems correspond to a certain type of optimization problems formulated over appropriate input distributions. Recently… 
Highly Cited
2017
Highly Cited
2017
A Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks
Inverse problems correspond to a certain type of optimization problems formulated over appropriate input distributions. Recently… 
Review
2014
Review
2014
A Survey of the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is very challengeable and interesting problem that can model many real-life problems. In… 
Highly Cited
2014
Highly Cited
2014
A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem
Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying… 
Highly Cited
2008
Highly Cited
2008
An algorithm for the generalized quadratic assignment problem
Abstract This paper reports on a new algorithm for the Generalized Quadratic Assignment problem (GQAP). The GQAP describes a… 
Highly Cited
2000
Highly Cited
2000
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
In this paper, a fitness landscape analysis for several instances of the quadratic assignment problem (QAP) is performed, and the… 
Highly Cited
1999
Highly Cited
1999
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
This article introduces two new techniques for solving the Quadratic Assignment Problem. The first is a heuristic technique… 
Highly Cited
1997
Highly Cited
1997
The Quadratic Assignment Problem
The quadratic assignment problem (QAP) was introduced by Koopmans and Beckmann in 1957 as a mathematical model for the location… 
Highly Cited
1994
Highly Cited
1994
Lower bounds for the quadratic assignment problem
We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the… 
Review
1972
Review
1972
A review of the placement and quadratic assignment problems
The physical design of a computer requires the placement of logic packages which must be interconnected to form a backplane. In… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)