A new heuristic for the linear placement problem

DOI10.1016/0305-0548(91)90027-OzbMath0723.90042OpenAlexW1985491240MaRDI QIDQ2276870

J. K. Suryanarayanan, Qiwen Wang, Bruce L. Golden

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90027-o

zbMATH Keywords

heuristicNP-completemultidimensional scalinglinear placement problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ Genetic algorithm for linear and cyclic assignment problem ⋮ Single row layout models ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Global Approaches for Facility Layout and VLSI Floorplanning

Cites Work

• Numerical investigations on quadratic assignment problems

This page was built for publication: A new heuristic for the linear placement problem