A convex form of the quadratic assignment problem (Q1804071)
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 222258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convex form of the quadratic assignment problem |
scientific article; zbMATH DE number 222258 |
Statements
A convex form of the quadratic assignment problem (English)
0 references
29 June 1993
0 references
It is shown how the objective function of the quadratic assignment problem can be made convex and how the convexity might be useful in solving the original problem. This procedure also leads to an easily applicable sufficient optimality condition.
0 references
quadratic assignment
0 references
sufficient optimality condition
0 references
0 references
0 references
0.9448818
0 references
0.9365693
0 references
0.93479586
0 references
0.9313442
0 references
0.9290952
0 references
0.9269687
0 references
0.9206935
0 references
