A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686)
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-cut algorithm for quadratic assignment problems based on linearizations |
scientific article; zbMATH DE number 5078754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for quadratic assignment problems based on linearizations |
scientific article; zbMATH DE number 5078754 |
Statements
A branch-and-cut algorithm for quadratic assignment problems based on linearizations (English)
0 references
7 December 2006
0 references
quadratic assignment problem
0 references
linearization
0 references
branch-and-cut
0 references
0 references
0.8792569041252136
0 references
0.8597193360328674
0 references
0.847709596157074
0 references
