# A Natural Quadratic Approach to the Generalized Graph Layering Problem

## TL;DR

This paper introduces a quadratic assignment-based exact method for the generalized graph layering problem, effectively handling various layout objectives and constraints with competitive computational performance.

## Contribution

It presents a novel quadratic formulation that naturally models layout restrictions and multiple objectives for graph layering, improving upon prior exact approaches.

## Key findings

- Competitive computational performance demonstrated
- Effective modeling of multiple layout objectives
- Outperforms previous exact models in experiments

## Abstract

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.