Pages that link to "Item:Q1849534"
From MaRDI portal
The following pages link to Solving large quadratic assignment problems on computational grids (Q1849534):
Displayed 15 items.
- Loop based facility planning and material handling (Q707078) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← 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 level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- A cooperative parallel tabu search algorithm for the quadratic assignment problem (Q2378423) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)