A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
From MaRDI portal
Publication:3944021
DOI10.1016/S0304-0208(08)73458-3zbMath0484.68051OpenAlexW60403651MaRDI QIDQ3944021
M. Gerrard, Nicos Christofides
Publication date: 1981
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73458-3
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Algorithms in computer science (68W99)
Related Items
Lower bounds for the quadratic assignment problem, A survey for the quadratic assignment problem, Quadratic assignment problems on series-parallel digraphs, Quadratic assignment problems, Contributions to the quadratic assignment problem, Locational analysis, A location problem on unicyclic networks: Balanced case, A layout design heuristic employing the theory of fuzzy sets, Room allocation: a polynomial subcase of the quadratic assignment problem, Cotas inferiores para el QAP-Arbol, Lower bounds for nonlinear assignment problems using many body interactions, Exact Solution of Two Location Problems via Branch-and-Bound
