An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem (Q2884300): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:32, 3 February 2024
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
