Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:37, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem |
scientific article |
Statements
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (English)
0 references
28 June 1992
0 references
Solution techniques for optimization problems often require bounds of the objective function. In this paper lower bounds are given for the quadratic assignment problem using an eigenvalue decomposition of the quadratic part and solving a linear program for the linear part. Applying ideas of parametric programming the sum of the two bounds is increased by a steepest ascent algorithm. There are numerical results showing the power of the new method.
0 references
quadratic assignment
0 references
eigenvalue decomposition
0 references
parametric programming
0 references
steepest ascent algorithm
0 references
