A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method |
scientific article; zbMATH DE number 1320329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method |
scientific article; zbMATH DE number 1320329 |
Statements
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (English)
0 references
3 August 1999
0 references
quadratic assignment problem
0 references
branch-and-bound
0 references
quadratic programming
0 references
integer programming
0 references
0 references
0.8965678811073303
0 references
0.8753290772438049
0 references
0.8605925440788269
0 references
