A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases

DOI10.1007/978-3-319-45587-7_36MaRDI QIDQ2835697zbMATH OpenOpenAlexFDO

Authors Maximilian John, Andreas Karrenbauer

Publication date 30 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45587-7_36

zbMATH Keywords

semidefinite programminglower boundbranch and boundquadratic assignment

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semidefinite programming (90C22) Discrete location and assignment (90B80)

Recommendations

• A low-dimensional semidefinite relaxation for the quadratic assignment problem
• A New Matrix Splitting Based Relaxation for the Quadratic Assignment Problem
• A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
• scientific article; zbMATH DE number 1894380
• Bounds for the quadratic assignment problem using the bundle method

Cites work

• scientific article; zbMATH DE number 3643044 (Why is no real title available?)
• scientific article; zbMATH DE number 1302195 (Why is no real title available?)
• scientific article; zbMATH DE number 714526 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A new relaxation framework for quadratic assignment problems based on matrix splitting
• A survey for the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
• Hospital Layout as a Quadratic Assignment Problem
• Lower bounds for the quadratic assignment problem
• On the quadratic assignment problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
• QAPLIB - a quadratic assignment problem library
• Semidefinite programming relaxations for the quadratic assignment problem
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Solving large quadratic assignment problems on computational grids
• The Backboard Wiring Problem: A Placement Algorithm
• The quadratic assignment problem

Cited in

(2)

• Combinatorial optimization problems in engineering applications
• A new relaxation framework for quadratic assignment problems based on matrix splitting

Describes a project that uses

Uses Software

• Biq Mac
• Mosek
• Gurobi
• QAPLIB

This page was built for publication: A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases

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