On the maximum quadratic assignment problem

MaRDI QIDQ4633862zbMATH OpenFDO

Authors Viswanath Nagarajan, Maxim Sviridenko

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496827

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• On the maximum quadratic assignment problem
• Approximating the minimum quadratic assignment problems
• Asymptotic Properties of the Quadratic Assignment Problem

Cited in

(14)

• Graph similarity and approximate isomorphism
• Approximating sparse quadratic programs
• Approximation algorithms for maximum linear arrangement
• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
• Approximating the minimum quadratic assignment problems
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• Maximizing polynomials subject to assignment constraints
• The Wiener maximum quadratic assignment problem
• On the maximum quadratic assignment problem
• Stochastic Analysis of the Quadratic Assignment Problem
• The Complexity of Homomorphism Indistinguishability
• Sinkhorn Algorithm for Lifted Assignment Problems
• scientific article; zbMATH DE number 1617262 (Why is no real title available?)
• A new greedy algorithm for the quadratic assignment problem

This page was built for publication: On the maximum quadratic assignment problem

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