The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization
problem that is concerned with the arrangement of n departments of given lengths on a line …

In this paper we discuss two particular layout problems, namely the Single-Row Equidistant
Facility Layout Problem (SREFLP) and the Single-Row Facility Layout Problem (SRFLP) …

Exploring and analyzing the temporal evolution of features in large-scale time-varying
datasets is a common problem in many areas of science and engineering. One natural …

Ordering problems assign weights to each ordering and ask to find an ordering of maximum
weight. We consider problems where the cost function is either linear or quadratic. In the first …

A storyline visualization is a layout that represents the temporal dynamics of social
interactions along time by the convergence of chronological lines. Among the criteria …

In many respects, crossing minimization is an exceptional problem in the wide range of
optimization problems arising in automatic graph drawing. First of all, it is one of the most …

Semidefinite optimization is a strong tool in the study of NP-hard combinatorial optimization
problems. On the one hand, semidefinite optimization problems are in principle solvable in …

62] Turan, P., A note of welcome, J. Graph Theory 1 (1977) 7-9. 63] Dambitis, J., An
algorithm for superimposing a nonplanar graph onto the plane with nearly minimal number …

Advancements in neutral atom quantum computers have positioned them as a valuable
framework for quantum computing, largely due to their prolonged coherence times and …

Edge concentration in dense bipartite graphs is a technique for reducing the numbers of
edges and edge crossings in graph drawings. The conventional method proposed by …