A Natural Quadratic Approach to the Generalized Graph Layering Problem

08/12/2019

∙

by   Sven Mallach, et al.

∙

0

∙

share

We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives, such as a minimum total arc length, minimum number of reversed arcs, and minimum width, or the adaptation to a specific drawing area. Our computational experiments show a competitive performance compared to prior exact models.