Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
From MaRDI portal
(Redirected from Publication:1187508)
Recommendations
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Taking advantage of symmetry in some quadratic assignment problems
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A note on asymptotic properties of the quadratic assignment problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Asymptotic Properties of the Quadratic Assignment Problem
Cites work
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Lower Bounds for the Partitioning of Graphs
- On lower bounds for a class of quadratic 0,1 programs
- On the quadratic assignment problem
- The variation of the spectrum of a normal matrix
Cited in
(4)
This page was built for publication: Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187508)