The quadratic assignment problem in the context of the printed circuit board assembly process
From MaRDI portal
Publication:850316
DOI10.1016/j.cor.2005.05.004zbMath1113.90130OpenAlexW2131807947MaRDI QIDQ850316
Publication date: 15 November 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.004
Related Items (9)
A multi-parent genetic algorithm for the quadratic assignment problem ⋮ A hybrid biased random key genetic algorithm for the quadratic assignment problem ⋮ A survey for the quadratic assignment problem ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ Experimental analysis of crossover and mutation operators on the quadratic assignment problem ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems ⋮ Unnamed Item ⋮ Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
Uses Software
Cites Work
- An improved annealing scheme for the QAP
- Optimization of the movements of a component placement machine
- Nonlinear assignment problems. Algorithms and applications
- Optimal bin location and sequencing in printed circuit board assembly
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- Algorithm 769
- Precedence constrained TSP arising in printed circuit board assembly
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The quadratic assignment problem in the context of the printed circuit board assembly process