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