Polynomial algorithms for solving the quadratic assignment problem on networks

DOI10.1134/S0965542510110175zbMath1224.90119OpenAlexW2074501059MaRDI QIDQ2996038

Gennady Grigorjevich Zabudsky, A. Yu. Lagzdin

Publication date: 4 May 2011

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542510110175

zbMATH Keywords

networksgraphsquadratic assignment problempolynomial algorithmsfacility location problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (2)

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems ⋮ Dynamic programming for the quadratic assignment problem on trees

This page was built for publication: Polynomial algorithms for solving the quadratic assignment problem on networks