An r-Dimensional Quadratic Placement Algorithm

DOI10.1287/mnsc.17.3.219zbMath0203.52503OpenAlexW2044348081WikidataQ105584987 ScholiaQ105584987MaRDI QIDQ5603742

K. M. Hall

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.17.3.219

Related Items (37)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Complex systems: features, similarity and connectivity ⋮ Exact Solution for the Optimal Neuronal Layout Problem ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Generating lower bounds for the linear arrangement problem ⋮ An overview of graph covering and partitioning ⋮ Graphs, Vectors, and Matrices ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Spectral partitioning works: planar graphs and finite element meshes ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Graph spectra in computer science ⋮ SPECTRAL METHODS CLUSTER WORDS OF THE SAME CLASS IN A SYNTACTIC DEPENDENCY NETWORK ⋮ A Sparse Stress Model ⋮ Coherent structure colouring: identification of coherent structures from sparse data using graph theory ⋮ A spectral characterization of the Delaunay triangulation ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme ⋮ A regularized graph layout framework for dynamic network visualization ⋮ Metric uniformization and spectral bounds for graphs ⋮ Equilateral Spherical Drawings of Planar Cayley Graphs ⋮ Variational perspective on local graph clustering ⋮ On the exact solution of a facility layout problem ⋮ Spectral methods for graph clustering - a survey ⋮ Normative location theory: Placement in continuous space ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ The Binary Stress Model for Graph Drawing ⋮ RingIt ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Coordinate Difference Matrices ⋮ A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem ⋮ Discrepancy and eigenvalues of Cayley graphs ⋮ Spectral partitioning with multiple eigenvectors ⋮ One-dimensional layout optimization, with applications to graph drawing by axis separation ⋮ Partitions of networks that are robust to vertex permutation dynamics ⋮ Drawing graphs by eigenvectors: theory and practice

This page was built for publication: An r-Dimensional Quadratic Placement Algorithm