Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337)
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 34338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem |
scientific article; zbMATH DE number 34338 |
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
0.8265182971954346
0 references
0.8172414302825928
0 references
