On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem (Q3962772)
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: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem |
scientific article; zbMATH DE number 3784630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem |
scientific article; zbMATH DE number 3784630 |
Statements
On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem (English)
0 references
1982
0 references
solution algorithm
0 references
test problems
0 references
computational experience
0 references
quadratic assignment problem
0 references
equivalent linear transformation
0 references
cutting planes
0 references
intersection cut
0 references
disjunctive cuts
0 references
reverse outer polar sets
0 references
optimal solution
0 references
heuristic algorithm
0 references
