A new lower bound for the quadratic assignment problem
From MaRDI portal
Recommendations
- The quadratic assignment problem. I: New lower bounds in paired assignment
- scientific article; zbMATH DE number 4027174
- A New Lower Bound for the Quadratic Assignment Problem
- Lower bounds for the quadratic assignment problem via triangle decompositions
- Lower bounds for the quadratic assignment problem
Cited in
(13)- New lower bounds for the triplanar assignment problem. Use of the classical model
- Lower bounds for the quadratic assignment problem
- Lower bounds based on linear programming for the quadratic assignment problem
- The quadratic assignment problem. I: New lower bounds in paired assignment
- Improved lower bounds for the quadratic assignment problem
- scientific article; zbMATH DE number 4143776 (Why is no real title available?)
- scientific article; zbMATH DE number 4027174 (Why is no real title available?)
- A New Lower Bound for the Quadratic Assignment Problem
- The Use of Specially Structured Models for Obtaining Bounds in the Quadratic Assignment Problem
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
- A new bound for the quadratic assignment problem based on convex quadratic programming
- A new algorithm for the quasi-assignment problem
- Bounds for the quadratic assignment problem using the bundle method
This page was built for publication: A new lower bound for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818125)