Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem

DOI10.1007/978-3-319-48749-6_54zbMath1486.90139OpenAlexW2545419187MaRDI QIDQ2958360

Sourour Elloumi, Amélie Lambert

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_54

zbMATH Keywords

semidefinite programmingquadratic assignment problemexperimentsconvex quadratic programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Discrete location and assignment (90B80)

Uses Software

• CSDP
• QAPLIB
• CPLEX
• MIQCR-CB

Cites Work

• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Extending the QCR method to general mixed-integer programs
• Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
• QAPLIB - a quadratic assignment problem library
• Semidefinite programming relaxations for the quadratic assignment problem
• P-Complete Approximation Problems
• CSDP, A C library for semidefinite programming
• Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
• Best reduction of the quadratic semi-assignment problem

This page was built for publication: Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem