A convex form of the quadratic assignment problem (Q1804071): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)90120-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2001201947 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A convex form of the quadratic assignment problem |
scientific article |
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
