Ranking scalar products to improve bounds for the quadratic assignment problem

DOI10.1016/0377-2217(85)90009-8zbMath0565.90055OpenAlexW1979166098MaRDI QIDQ1058988

J. Blot

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90009-8

zbMATH Keywords

quadratic assignmentlower boundssuboptimal solutionsk-best scalar productsranking procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

Copositive and semidefinite relaxations of the quadratic assignment problem ⋮ A new exact algorithm for the solution of quadratic assignment problems ⋮ A survey for the quadratic assignment problem ⋮ k-Best constrained bases of a matroid ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem ⋮ Problema de asignacion cuadratica multiobjetivo ⋮ Compounded genetic algorithms for the quadratic assignment problem ⋮ Single- and multi-objective facility layout with workflow interference considerations

Cites Work

• Unnamed Item
• Unnamed Item
• Quadratic assignment problems
• The spread of a matrix
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost