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

DOI10.1007/BFB0120905MaRDI QIDQ3883914zbMATH OpenOpenAlexFDO

Authors 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

binary branch and bound algorithmexact solutiongreedy approximationKoopmans-Beckmann quadratic assignment problemtransformation

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cited in

(8)

• On the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• ADMM for the SDP relaxation of the QAP
• RLT insights into lift-and-project closures
• 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
• Selected topics on assignment problems
• A survey for the quadratic assignment problem

This page was built for publication: A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883914)