Approximating the minimum quadratic assignment problems

DOI10.1145/1644015.1644033zbMath1300.90024OpenAlexW1982810715MaRDI QIDQ2930294

Asaf Levin, M. I. Sviridenko, Refael Hassin

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.689

zbMATH Keywords

quadratic assignment problemapproximation algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? ⋮ Maximizing Polynomials Subject to Assignment Constraints ⋮ Dynamic programming for the quadratic assignment problem on trees ⋮ Minimum Congestion Mapping in a Cloud

This page was built for publication: Approximating the minimum quadratic assignment problems