Solving large quadratic assignment problems in parallel
From MaRDI portal
Publication:1366297
DOI10.1023/A:1008696503659zbMath0887.90136OpenAlexW1569366990MaRDI QIDQ1366297
Jens Clausen, Michael Perregaard
Publication date: 25 May 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008696503659
Quadratic programming (90C20) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)
Related Items
Flow distance reduction for a multi-product flowline with sets of identical machines ⋮ An extreme point algorithm for a local minimum solution to the quadratic assignment problem ⋮ A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem ⋮ A survey for the quadratic assignment problem ⋮ A branch-and-cut algorithm for quadratic assignment problems based on linearizations ⋮ A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives ⋮ Bounds for the quadratic assignment problem using the bundle method ⋮ Integrating combinatorial algorithms into a linear programming solver ⋮ Gilmore-Lawler bound of quadratic assignment problem ⋮ A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique ⋮ Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters ⋮ Exact solution of emerging quadratic assignment problems ⋮ The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases ⋮ New linearizations of quadratic assignment problems ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
