An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem (Q2884300): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.1110.0509 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964265873 / rank | |||
Normal rank | |||
Revision as of 20:46, 19 March 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
