More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of the algorithm and discuss its effect on subsequent literature. We also improve some aspects of the notation.

In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguished features including an efficient heuristic to generate good quality initial solutions, a highly discriminating evaluation function, a special neighborhood function and an effective cooling schedule. The algorithm is...

This paper gives a survey on extended and generalized weight enumerators of a linear code and the Tutte polynomial of the matroid of the code [16]. Furthermore ongoing research is reported on the coset leader and list weight enumerator and its extensions using the derived code and its arrangement of hyperplanes.

This paper presents the derivation of the model for a high-precision positioning system using magnetic levitation, which is achieved by an arrangement of Permanent Magnet Linear Synchronous Motors. LQR set-point stabilization is performed as an introduction to the more advanced nonlinear control design presented in [9].

analysis of variance (ANOVA): one-way nested, hierarchical two-way linear model fixed, random, and mixed models factorial arrangement of treatments variance components sum of squares, mean square, expected mean square sampling fraction, fixed effects, random effects simple effects, main effects, interaction effects, additive effects analysis of covariance, covariate, concomitant variable data t...

In this paper we present and analyze new sequential and parallel heuristics to approximate the Minimum Linear Arrangement problem (MinLA). The heuristics consist in obtaining a first global solution using Spectral Sequencing and improving it locally through Simulated Annealing. In order to accelerate the annealing process, we present a special neighborhood distribution that tends to favor moves...

This paper discusses algorithmic and implementation issues of optimally mapping a visualization pipeline onto a linear arrangement of wide-area network nodes to minimize the total delay. The first network node typically is a data source, the last node could be a display device ranging from a personal computer to a powerwall, and each intermediate node could be a workstation or computational clu...