Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem

DOI10.1007/978-3-319-48749-6_54MaRDI QIDQ2958360zbMATH OpenOpenAlexFDO

Authors 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

quadratic assignment problemsemidefinite programmingexperimentsconvex quadratic programming

Mathematics Subject Classification ID

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

Recommendations

• A convex form of the quadratic assignment problem
• Solving quadratic assignment problems using convex quadratic programming relaxations
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• A revised reformulation-linearization technique for the quadratic assignment problem
• A new bound for the quadratic assignment problem based on convex quadratic programming
• A new form of the quadratic assignment problem and approximate solutions
• scientific article; zbMATH DE number 714526
• Improved discrete reformulations for the quadratic assignment problem
• Comparison of iterative searches for the quadratic assignment problem
• A contribution to quadratic assignment problems

Cites work

• Best reduction of the quadratic semi-assignment problem
• CSDP, A C library for semidefinite programming
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Extending the QCR method to general mixed-integer programs
• P-Complete Approximation Problems
• QAPLIB - a quadratic assignment problem library
• Semidefinite programming relaxations for the quadratic assignment problem
• Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
• Using a conic bundle method to accelerate both phases of a quadratic convex reformulation

Cited in

(9)

• Piecewise convex formulations of binary and permutation problems
• Improved discrete reformulations for the quadratic assignment problem
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• Best reduction of the quadratic semi-assignment problem
• Solving quadratic assignment problems using convex quadratic programming relaxations
• A quadratic assignment formulation of the molecular conformation problem
• A proximal DC approach for quadratic assignment problem
• A convex form of the quadratic assignment problem
• On improving convex quadratic programming relaxation for the quadratic assignment problem

Describes a project that uses

Uses Software

• MIQCR-CB
• CPLEX
• QAPLIB
• CSDP

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

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