Solving quadratic assignment problems using convex quadratic programming relaxations (Q2774598)
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: Solving quadratic assignment problems using convex quadratic programming relaxations |
scientific article; zbMATH DE number 1711038
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving quadratic assignment problems using convex quadratic programming relaxations |
scientific article; zbMATH DE number 1711038 |
Statements
Solving quadratic assignment problems using convex quadratic programming relaxations (English)
0 references
26 February 2002
0 references
branch-and-bound algorithm
0 references
quadratic assignment problem
0 references
convex quadratic programming
0 references
Frank-Wolfe algorithm
0 references
0 references
0.9468908
0 references
0.9448818
0 references
0.93797636
0 references
0.9307844
0 references
0.9290346
0 references
0.9278612
0 references
0.9274297
0 references
0.9268638
0 references
