A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:56, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method |
scientific article |
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
