Second order cone programming relaxation for quadratic assignment problems

Authors:
Yong Xia
Affiliations:
Department of Applied Mathematics, Beihang University, Beijing, People's Republic of China
Venue:
Optimization Methods & Software
Year:
2008

Citing 3
Cited 1

A new lower bound via projection for the quadratic assignment problem

Mathematics of Operations Research
P-Complete Approximation Problems

Journal of the ACM (JACM)
On Lagrangian Relaxation of Quadratic Matrix Constraints

SIAM Journal on Matrix Analysis and Applications

A trust region SQP-filter method for nonlinear second-order cone programming

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a second order cone programming relaxation with O(n2) variables for quadratic assignment problems, which provides a lower bound not less than the well-known quadratic programming bound. It is further strengthened by additional linear inequalities.