Pages that link to "Item:Q1366297"
From MaRDI portal
The following pages link to Solving large quadratic assignment problems in parallel (Q1366297):
Displaying 30 items.
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem (Q850313) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791) (← links)
- Algorithms for assignment problems on an array processor (Q1124328) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Solving large-scale QAP problems in parallel with the serach library ZRAM (Q1268834) (← links)
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases (Q1290637) (← links)
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel (Q1384091) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- Solving large quadratic assignment problems on computational grids (Q1849534) (← links)
- Flow distance reduction for a multi-product flowline with sets of identical machines (Q1873007) (← links)
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- \(D\&C\) method for solving large problems in fixed size processor array (Q2751940) (← links)
- Very large-scale neighborhood search for the quadratic assignment problem (Q2892376) (← links)
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid (Q2909213) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- (Q4251076) (← links)
- (Q4323613) (← links)
- The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases (Q4645924) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
