The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
From MaRDI portal
Publication:3902819
Cited in
(14)- Optimization of the quadratic assignment problem using an ant colony algorithm
- Strengthening Gilmore's bound for the quadratic assignment problem
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- A hybrid heuristic for the facilities layout problem
- A layout design heuristic employing the theory of fuzzy sets
- The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey
- The facility layout problem
- Optimal sequences in stochastic single machine shops
- An improved annealing scheme for the QAP
- Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models
- An exact algorithm for the general quadratic assignment problem
This page was built for publication: The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902819)