A Review of the Placement and Quadratic Assignment Problems

Cited in

(26)

The facility layout problem
Solution of placement and routing problems in telephone exchange unit designs
Finding linear and circular sequences of minimal and maximal total adjacency
Contributions to the quadratic assignment problem
A heuristic procedure for solving the quadratic assignment problem
Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
Locational analysis
An intermediate-value theorem for optimum tree valuation
A cell formation algorithm: Hypergraph approximation -- cut tree
Strengthening Gilmore's bound for the quadratic assignment problem
A genetic approach to the quadratic assignment problem
A convex form of the quadratic assignment problem
Combining simulated annealing with local search heuristics
A hybrid heuristic for the facilities layout problem
Genetic algorithm for linear and cyclic assignment problem
A layout design heuristic employing the theory of fuzzy sets
Near-optimal heuristics for an assignment problem in mass storage
Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme
Algorithm for tool placement in an automatic tool change magazine
On a binary distance model for the minimum linear arrangement problem
Graph layout problems
Enhanced migrating birds optimization algorithm for optimization problems in different domains
On optimal linear arrangements of trees
On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
A survey for the quadratic assignment problem
Mathematical methods for physical layout of printed circuit boards: an overview

This page was built for publication: A Review of the Placement and Quadratic Assignment Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652457)