Second order cone programming relaxation for quadratic assignment problems

DOI10.1080/10556780701843405MaRDI QIDQ3514847zbMATH OpenOpenAlexFDO

Authors Yong Xia

Publication date 23 July 2008

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780701843405

zbMATH Keywords

quadratic assignment problemsecond order cone programmingquadratic programming bound

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• On improving convex quadratic programming relaxation for the quadratic assignment problem
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Solving quadratic assignment problems using convex quadratic programming relaxations
• A low-dimensional semidefinite relaxation for the quadratic assignment problem
• Copositive and semidefinite relaxations of the quadratic assignment problem

Cited in

(10)

• Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
• Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
• A trust region SQP-filter method for nonlinear second-order cone programming
• Quadratic optimization over a second-order cone with linear equality constraints
• The \(Q\) method for second order cone programming
• Convex Relaxations of (0, 1)-Quadratic Programming
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• scientific article; zbMATH DE number 714535 (Why is no real title available?)
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS

This page was built for publication: Second order cone programming relaxation for quadratic assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514847)