A new relaxation framework for quadratic assignment problems based on matrix splitting
type: Item
instance of: scholarly article
title: A new relaxation framework for quadratic assignment problems based on matrix splitting
zbMATH Open document ID: 1191.65071
author: Jiming Peng
author: Xiaoxue Li
author: Hans D. Mittelmann
published in: Mathematical Programming Computation
publication date: 2010-06-21T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5723784
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: semidefinite programming
zbMATH Keywords: matrix splitting
zbMATH Keywords: relaxation
zbMATH Keywords: lower bound
zbMATH Keywords: numerical examples
describes a project that uses: QAPLIB
describes a project that uses: CVX
describes a project that uses: Matlab
describes a project that uses: SDPT3
MaRDI profile type: Publication
full work available at URL: s12532-010-0012-6
OpenAlex ID: W2019352048
cites work: Q4321548
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: A new bound for the quadratic assignment problem based on convex quadratic programming
cites work: Solving large quadratic assignment problems on computational grids
cites work: Bounds on the Performance of Vector-Quantizers Under Channel Errors
cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs
cites work: QAPLIB - a quadratic assignment problem library
cites work: Q5682350
cites work: Q3356330
cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem
cites work: Lower bounds for the quadratic assignment problem based upon a dual formulation
cites work: Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
cites work: Assignment Problems and the Location of Economic Activities
cites work: The quadratic assignment problem
cites work: A survey for the quadratic assignment problem
cites work: Q4328336
cites work: Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
cites work: Minimax nonredundant channel coding
cites work: Bounds for the quadratic assignment problem using the bundle method
cites work: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
cites work: Comparison of iterative searches for the quadratic assignment problem
cites work: Semidefinite programming relaxations for the quadratic assignment problem
DOI: 10.1007/S12532-010-0012-6
description: scientific article; zbMATH DE number 5723784