An Exact Algorithm for the Quadratic Assignment Problem on a Tree (Q4732306): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.37.5.760 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010971800 / rank | |||
Normal rank | |||
Latest revision as of 01:01, 20 March 2024
scientific article; zbMATH DE number 4118159
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Exact Algorithm for the Quadratic Assignment Problem on a Tree |
scientific article; zbMATH DE number 4118159 |
Statements
An Exact Algorithm for the Quadratic Assignment Problem on a Tree (English)
0 references
1989
0 references
polynomial bound
0 references
Quadratic Assignment Problem
0 references
NP-complete
0 references
Traveling Salesman
0 references
branch-and-bound
0 references
Langrangian relaxation
0 references
