The quadratic assignment problem (Q3147670)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1803767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quadratic assignment problem |
scientific article; zbMATH DE number 1803767 |
Statements
22 April 2003
0 references
quadratic assigment
0 references
0.8890019655227661
0 references
0.8778780102729797
0 references
The quadratic assignment problem (English)
0 references
The paper provides a survey about the quadratic assignment problem. Motivated by the example of a campus planning problem, the quadratic assignment problem is introduced and alternative formulations are discussed. An overview about the various applications and a discussion of the computational complexity of the problem are included as well as a detailed description of alternative relaxation strategies. The survey is concluded with a short section on heuristics and a computational study comparing the quality of bounds resulting from the different problem relaxations. For the entire collection see [Zbl 0988.00044].
0 references