On improving convex quadratic programming relaxation for the quadratic assignment problem

DOI10.1007/S10878-013-9655-3zbMath1346.90620arXiv1204.4562OpenAlexW1984255470MaRDI QIDQ498438

Yong Xia, Wajeb Gharibi

Publication date: 28 September 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4562

zbMATH Keywords

quadratic programmingquadratic assignment problemlower boundcapacitated transportation problem

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Uses Software

• CVX
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey for the quadratic assignment problem
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• Lower bounds for the quadratic assignment problem
• QAPLIB - a quadratic assignment problem library
• The quadratic assignment problem. Theory and algorithms
• Semidefinite programming relaxations for the quadratic assignment problem
• Recent advances in the solution of quadratic assignment problems
• On Lagrangian Relaxation of Quadratic Matrix Constraints
• Solving quadratic assignment problems using convex quadratic programming relaxations
• Second order cone programming relaxation for quadratic assignment problems
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• P-Complete Approximation Problems
• A new bound for the quadratic assignment problem based on convex quadratic programming

This page was built for publication: On improving convex quadratic programming relaxation for the quadratic assignment problem