Solution Approaches for the Double-Row ...

We consider the Double-Row Equidistant Facility Layout Problem
and show that the number of spaces needed to preserve at least one optimal
solution is much smaller compared to the general double-row layout problem.
We exploit this fact to tailor exact integer linear programming (ILP) and
semidefinite programming (SDP) approaches that outperform other recent
methods for this problem. We report computational results on a variety of
benchmark instances showing that the ILP is preferable for small and medium
instances whereas the SDP yields better results on large instances with up to
60 departments.