A new bound for the quadratic assignment problem based on convex quadratic programming
From MaRDI portal
Publication:5930731
DOI10.1007/s101070100214zbMath0986.90042MaRDI QIDQ5930731
Kurt M. Anstreicher, Nathan W. Brixius
Publication date: 5 June 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Taking advantage of symmetry in some quadratic assignment problems, A survey for the quadratic assignment problem, A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives, Bounds for the quadratic assignment problem using the bundle method, A level-2 reformulation-linearization technique bound for the quadratic assignment problem, A new exact discrete linear reformulation of the quadratic assignment problem, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Sinkhorn Algorithm for Lifted Assignment Problems, On improving convex quadratic programming relaxation for the quadratic assignment problem, ADMM for the SDP relaxation of the QAP, The MIN-cut and vertex separator problem, Mapping the convergence of genetic algorithms, Measuring instance difficulty for combinatorial optimization problems, Sufficient global optimality conditions for bivalent quadratic optimization, A new relaxation framework for quadratic assignment problems based on matrix splitting, A performance guarantee heuristic for electronic components placement problems including thermal effects, Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem, An algorithm for the generalized quadratic assignment problem, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, SDP Relaxations for Some Combinatorial Optimization Problems, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, A note on lack of strong duality for quadratic problems with orthogonal constraints, A revised reformulation-linearization technique for the quadratic assignment problem, An exterior point polynomial-time algorithm for convex quadratic programming, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
Uses Software
