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