A New Lower Bound Via Projection for the Quadratic Assignment Problem
From MaRDI portal
Recommendations
- A New Lower Bound for the Quadratic Assignment Problem
- Lower bounds based on linear programming for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Lower bounds for the quadratic assignment problem via triangle decompositions
Cited in
(40)- Exact solution of two location problems via branch-and-bound
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- New linearizations of quadratic assignment problems
- Selected topics on assignment problems
- Solving the max-cut problem using eigenvalues
- A projection technique for partitioning the nodes of a graph
- An efficient continuation method for quadratic assignment problems
- Semidefinite programming for discrete optimization and matrix completion problems
- On approximability of linear ordering and related NP-optimization problems on graphs.
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Matrix differential equations: a continuous realization process for linear algebra problems
- Continuous relaxations for the traveling salesman problem
- A survey for the quadratic assignment problem
- A New Lower Bound for the Quadratic Assignment Problem
- Laplace eigenvalues of graphs---a survey
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Lower bounds based on linear programming for the quadratic assignment problem
- A modification of threshold accepting and its application to the quadratic assignment problem
- Generating QAP instances with known optimum solution and additively decomposable cost function
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- Lower bounds for the quadratic assignment problem via triangle decompositions
- Bounds for the quadratic assignment problem using the bundle method
- On the equivariance properties of self-adjoint matrices
- Location and layout planning. A survey
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- scientific article; zbMATH DE number 714535 (Why is no real title available?)
- A spectral approach to bandwidth and separator problems in graphs
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Convex hull of the orthogonal similarity set with applications in quadratic assignment problems
- A new bound for the quadratic assignment problem based on convex quadratic programming
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- Convergence of a modified algorithm of fast probabilistic modeling
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Effective formulation reductions for the quadratic assignment problem
- Lower bounds for the quadratic assignment problem
This page was built for publication: A New Lower Bound Via Projection for the Quadratic Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022029)
