广义图分层问题的自然二次逼近
A Natural Quadratic Approach to the Generalized Graph Layering Problem
摘要：
我们提出了一个新的精确的方法，广义图分层问题，是基于一个特定的二次分配制定。它以自然的方式表示关联的布局限制和几个可能的目标，例如最小总弧长、最小反向弧数和最小宽度，或对特定绘图区域的调整。我们的计算实验显示了竞争力的性能相比，以前的精确模型。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
