Recent advances in the solution of quadratic assignment problems
From MaRDI portal
Publication:1403282
DOI10.1007/S10107-003-0437-ZzbMath1035.90067OpenAlexW34399546MaRDI QIDQ1403282
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0437-z
Related Items (38)
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems ⋮ Copositive and semidefinite relaxations of the quadratic assignment problem ⋮ Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A survey for the quadratic assignment problem ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ An efficient continuation method for quadratic assignment problems ⋮ Bounds for the quadratic assignment problem using the bundle method ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ Semidefinite approximations for quadratic programs over orthogonal matrices ⋮ A new exact discrete linear reformulation of the quadratic assignment problem ⋮ Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem ⋮ Gilmore-Lawler bound of quadratic assignment problem ⋮ On the generalized trace ratio problem ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry ⋮ Global optimization of a class of nonconvex quadratically constrained quadratic programming problems ⋮ Biological computation of the solution to the quadratic assignment problem ⋮ The random quadratic assignment problem ⋮ Continuation methods for approximate large scale object sequencing ⋮ On improving convex quadratic programming relaxation for the quadratic assignment problem ⋮ ADMM for the SDP relaxation of the QAP ⋮ An experimental study of variable depth search algorithms for the quadratic assignment problem ⋮ Random assignment problems ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Repulsive assignment problem ⋮ New linearizations of quadratic assignment problems ⋮ Local minima and convergence in low-rank semidefinite programming ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Optimizing a polyhedral-semidefinite relaxation of completely positive programs ⋮ A proximal DC approach for quadratic assignment problem ⋮ QPLIB: a library of quadratic programming instances ⋮ SDP Relaxations for Some Combinatorial Optimization Problems ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications
Uses Software
This page was built for publication: Recent advances in the solution of quadratic assignment problems
