A New Lower Bound Via Projection for the Quadratic Assignment Problem
From MaRDI portal
Publication:4022029
DOI10.1287/moor.17.3.727zbMath0767.90059OpenAlexW2107454643MaRDI QIDQ4022029
Henry Wolkowicz, Franz Rendl, Scott W. Hadley
Publication date: 17 January 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7a2b6a279631f981a1977da20c8eb9da8bfe7993
Related Items
Lower bounds for the quadratic assignment problem, Solving the max-cut problem using eigenvalues, A survey for the quadratic assignment problem, A projection technique for partitioning the nodes of a graph, A modification of threshold accepting and its application to the quadratic assignment problem, Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps, An efficient continuation method for quadratic assignment problems, Bounds for the quadratic assignment problem using the bundle method, Lower bounds for the quadratic assignment problem via triangle decompositions, Location and layout planning. A survey, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Generating QAP instances with known optimum solution and additively decomposable cost function, Matrix differential equations: a continuous realization process for linear algebra problems, A spectral approach to bandwidth and separator problems in graphs, Global optimization of a class of nonconvex quadratically constrained quadratic programming problems, On approximability of linear ordering and related NP-optimization problems on graphs., On the equivariance properties of self-adjoint matrices, Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality, On improving convex quadratic programming relaxation for the quadratic assignment problem, Convergence of a modified algorithm of fast probabilistic modeling, Laplace eigenvalues of graphs---a survey, New linearizations of quadratic assignment problems, Selected topics on assignment problems, Semidefinite programming for discrete optimization and matrix completion problems, Effective formulation reductions for the quadratic assignment problem, A new relaxation framework for quadratic assignment problems based on matrix splitting, Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Lower bounds based on linear programming for the quadratic assignment problem, Continuous relaxations for the traveling salesman problem, Algorithms for graph partitioning problems by means of eigenspace relaxations, Exact Solution of Two Location Problems via Branch-and-Bound, A note on lack of strong duality for quadratic problems with orthogonal constraints, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
