Given an undirected graph , we consider injective mappings of its vertices to the ‐dimensional Cartesian integer grid. Among such embeddings we are interested in those that minimize the sum of the resulting edge lengths, where the length of an edge is defined by the ‐metric. The case is the well‐known Minimum Linear Arrangement Problem. We prove that the general problem is NP‐hard for any fixed grid dimension. Our computational study focuses on the case . We present as a first exact optimization algorithm a branch‐and‐cut scheme for sparse graphs. Several classes of valid inequalities are introduced and analyzed for facet defining properties of two corresponding polyhedra. Finally, computational results from a successful real‐world application of the problem at the German Cancer Research Center (DKFZ) are presented.
