On the maximum quadratic assignment problem

zbMATH Open1423.90234MaRDI QIDQ4633862FDOQ4633862

Authors: Viswanath Nagarajan, Maxim Sviridenko 

Publication date: 6 May 2019

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

Recommendations

• On the maximum quadratic assignment problem
• Approximating the minimum quadratic assignment problems
• Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm
• Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm
• Asymptotic Properties of the Quadratic Assignment Problem

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)

Cited In (11)

• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
• The Complexity of Homomorphism Indistinguishability
• Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• Title not available (Why is that?)
• Stochastic Analysis of the Quadratic Assignment Problem
• Graph Similarity and Approximate Isomorphism
• Sinkhorn Algorithm for Lifted Assignment Problems
• Approximating the minimum quadratic assignment problems
• Approximation algorithms for maximum linear arrangement
• On the maximum 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)