A Review of the Placement and Quadratic Assignment Problems
From MaRDI portal
Publication:5652457
DOI10.1137/1014035zbMath0241.90048OpenAlexW1980129108MaRDI QIDQ5652457
Jerome M. Kurtzberg, Maurice Hanan
Publication date: 1972
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1014035
Related Items
Strengthening Gilmore's bound for the quadratic assignment problem, Genetic algorithm for linear and cyclic assignment problem, The facility layout problem, A genetic approach to the quadratic assignment problem, A survey for the quadratic assignment problem, Solution of placement and routing problems in telephone exchange unit designs, Combining simulated annealing with local search heuristics, Graph layout problems, 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, Near-optimal heuristics for an assignment problem in mass storage, Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme, On a binary distance model for the minimum linear arrangement problem, Locational analysis, A layout design heuristic employing the theory of fuzzy sets, Algorithm for tool placement in an automatic tool change magazine, A hybrid heuristic for the facilities layout problem, Mathematical methods for physical layout of printed circuit boards: an overview, An intermediate-value theorem for optimum tree valuation, A convex form of the quadratic assignment problem, On optimal linear arrangements of trees, On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem, A cell formation algorithm: Hypergraph approximation -- cut tree
