An Exact Algorithm for the Quadratic Assignment Problem on a Tree (Q4732306)
From MaRDI portal
!
WARNING
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 4118159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8705782890319824
0 references
0.8408767580986023
0 references
0.8318842649459839
0 references
0.8282024264335632
0 references
