A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem

DOI10.1007/BFb0120905zbMath0441.90081OpenAlexW2120091187MaRDI QIDQ3883914

Christopher S. Edwards

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120905

zbMATH Keywords

exact solutiontransformationgreedy approximationbinary branch and bound algorithmKoopmans-Beckmann quadratic assignment problem

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

Lower bounds for the quadratic assignment problem, A survey for the quadratic assignment problem, On the quadratic assignment problem, ADMM for the SDP relaxation of the QAP, RLT insights into lift-and-project closures, Selected topics on assignment problems, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, A branch-and-bound-based heuristic for solving the quadratic assignment problem