Lower bounds for the quadratic assignment problem via triangle decompositions
From MaRDI portal
Publication:1914071
DOI10.1007/BF01585995zbMath0846.90091OpenAlexW2070496218MaRDI QIDQ1914071
Stefan E. Karisch, Franz Rendl
Publication date: 30 September 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585995
Related Items (max. 100)
A survey for the quadratic assignment problem ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices ⋮ Exploiting hardware capabilities in interior point methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QAPLIB-A quadratic assignment problem library
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Optimal linear labelings and eigenvalues of graphs
- Massively parallel tabu search for the quadratic assignment problem
- The Quadratic Assignment Problem
- Optimization and nonsmooth analysis
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- A spectral approach to bandwidth and separator problems in graphs
- Optimal Assignments of Numbers to Vertices
- Lower Bounds for the Partitioning of Graphs
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
This page was built for publication: Lower bounds for the quadratic assignment problem via triangle decompositions
