A Fourier space algorithm for solving quadratic assignment problems

MaRDI QIDQ5417685zbMATH OpenFDO

Authors Risi Kondor

Publication date 22 May 2014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1302195
• scientific article; zbMATH DE number 714526
• A new exact algorithm for the solution of quadratic assignment problems
• The quadratic assignment problem. Theory and algorithms
• Solving the quadratic assignment problem using F-MSG algorithm

Cited in

(7)

• FaSa: A fast and stable quadratic placement algorithm
• Signal processing on the permutahedron: tight spectral frames for ranked data analysis
• Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
• Representation theory of the symmetric group in voting theory and game theory
• Where the really hard quadratic assignment problems are: the QAP-SAT instances
• Fast generalized DFTs for all finite groups
• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions

This page was built for publication: A Fourier space algorithm for solving quadratic assignment problems

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