Solving large quadratic assignment problems in parallel
From MaRDI portal
Recommendations
Cited in
(31)- A parallel branch and bound algorithm for the quadratic assignment problem
- Integrating combinatorial algorithms into a linear programming solver
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Algorithms for assignment problems on an array processor
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- BiqBin: moving boundaries for NP-hard problems by HPC
- scientific article; zbMATH DE number 1304344 (Why is no real title available?)
- A survey for the quadratic assignment problem
- Better process mapping and sparse quadratic assignment
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Bounds for the quadratic assignment problem using the bundle method
- Exact solution of emerging quadratic assignment problems
- Gilmore-Lawler bound of quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- New linearizations of quadratic assignment problems
- Very large-scale neighborhood search for the quadratic assignment problem
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- scientific article; zbMATH DE number 1996465 (Why is no real title available?)
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
- \(D\&C\) method for solving large problems in fixed size processor array
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- Solving large quadratic assignment problems on computational grids
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem
- scientific article; zbMATH DE number 714538 (Why is no real title available?)
- scientific article; zbMATH DE number 724213 (Why is no real title available?)
- Flow distance reduction for a multi-product flowline with sets of identical machines
This page was built for publication: Solving large quadratic assignment problems in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366297)
