On the maximum quadratic assignment problem
From MaRDI portal
Recommendations
Cited in
(19)- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- Approximation algorithms for maximum linear arrangement
- A new greedy algorithm for the quadratic assignment problem
- scientific article; zbMATH DE number 1617262 (Why is no real title available?)
- Approximating the minimum quadratic assignment problems
- Maximizing Polynomials Subject to Assignment Constraints
- Stochastic Analysis of the Quadratic Assignment Problem
- Asymptotic Properties of the Quadratic Assignment Problem
- scientific article; zbMATH DE number 1985298 (Why is no real title available?)
- Maximizing polynomials subject to assignment constraints
- On the maximum quadratic assignment problem
- Lov\'asz Meets Weisfeiler and Leman
- Minimum congestion mapping in a cloud
- On the maximum edge-pair embedding bipartite matching
- Approximating sparse quadratic programs
- Approximation algorithms for the maximum-weight cycle/path packing problems
- The Wiener maximum quadratic assignment problem
- Graph similarity and homomorphism densities
- A subgradient-based continuous-time algorithm for constrained distributed quadratic programming
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 Q3169070)