A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem

DOI10.1007/978-3-319-32859-1_45MaRDI QIDQ2807873zbMATHOpenAlexFDO

Authors M. Lange

Publication date 25 May 2016

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-32859-1_45

zbMATH Keywords

quadratic assignment problemsemidefinite programmingrelaxation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Semidefinite programming (90C22) Discrete location and assignment (90B80)

Recommendations

• A new relaxation framework for quadratic assignment problems based on matrix splitting
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
• A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
• A new solution method based on Lagrangian relaxation for the quadratic assignment problem
• A Relaxed Assignment Algorithm For The Quadratic Assignement Problem
• scientific article; zbMATH DE number 5152705
• On improving convex quadratic programming relaxation for the quadratic assignment problem
• Solving quadratic assignment problems using convex quadratic programming relaxations
• A new linearization method for quadratic assignment problems
• A new exact algorithm for the solution of quadratic assignment problems

Cited in

(8)

• scientific article; zbMATH DE number 1786176 (Why is no real title available?)
• scientific article; zbMATH DE number 5152705 (Why is no real title available?)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
• scientific article; zbMATH DE number 7716275 (Why is no real title available?)
• A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
• A new relaxation framework for quadratic assignment problems based on matrix splitting
• A low-dimensional semidefinite relaxation for the quadratic assignment problem
• Estimating bounds for quadratic assignment problems associated with Hamming and Manhattan distance matrices based on semidefinite programming

This page was built for publication: A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem

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