An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem (Q2884300)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n4) Algorithm for the QAP Linearization Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem |
scientific article |
Statements
An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem (English)
0 references
24 May 2012
0 references
quadratic assignment problem
0 references
linearization
0 references
polynomial algorithms
0 references
solvable cases
0 references
