A branch-and-bound-based heuristic for solving the quadratic assignment problem (Q3694983)
From MaRDI portal
!
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 3920190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound-based heuristic for solving the quadratic assignment problem |
scientific article; zbMATH DE number 3920190 |
Statements
A branch-and-bound-based heuristic for solving the quadratic assignment problem (English)
0 references
1983
0 references
facility location
0 references
branch-and-bound algorithm
0 references
quadratic assignment problem
0 references
0.9565129
0 references
0.9421965
0 references
0.94105124
0 references
0 references
0.9241543
0 references
0.92358047
0 references
