A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
From MaRDI portal
Publication:2835697
DOI10.1007/978-3-319-45587-7_36zbMATH Open1445.90052OpenAlexW2508895343MaRDI QIDQ2835697FDOQ2835697
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
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
Combinatorial optimization (90C27) Semidefinite programming (90C22) Discrete location and assignment (90B80)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Title not available (Why is that?)
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Title not available (Why is that?)
- A survey for the quadratic assignment problem
- On the quadratic assignment problem
- Semidefinite programming relaxations for the quadratic assignment problem
- The quadratic assignment problem
- Title not available (Why is that?)
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Solving large quadratic assignment problems on computational grids
- The Backboard Wiring Problem: A Placement Algorithm
- Hospital Layout as a Quadratic Assignment Problem
- Title not available (Why is that?)
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Lower bounds for the quadratic assignment problem
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
Uses Software
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)
