OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Quadratic assignment problem

 Home Mathematics History of mathematics Mathematical problems Computational problems NP-hard problems
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Quadratic Assignment Problem (QAP) is a classic problem in combinatorial optimization. It can be defined as follows: Imagine you have two sets: 1. A set of **n** facilities (like warehouses, factories, etc.). 2. A set of **n** locations (like sites or areas where the facilities can be placed).

 Ancestors (6)

  1. NP-hard problems
  2. Computational problems
  3. Mathematical problems
  4. History of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook