Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an ordering is the maximum cutwidth of any vertex with respect to this ordering. We are interested in finding the cutwidth of a graph, that is, the minimum cutwidth over all orderings, which is an NP-hard problem. In order to approximate the cutwidth of a given graph, we present a semidefinite relaxation. We identify several classes of valid inequalities and equalities that we use to strengthen the semidefinite relaxation. These classes are on the one hand the well-known 3-dicycle equations and the triangle inequalities and on the other hand we obtain inequalities from the squared linear ordering polytope and via lifting the linear ordering polytope. The solution of the semidefinite program serves to obtain a lower bound and also to construct a feasible solution and thereby having an upper bound on the cutwidth. In order to evaluate the quality of our bounds, we perform numerical experiments on graphs of different sizes and densities. It turns out that we produce high quality bounds for graphs of medium size independent of their density in reasonable time. Compared to that, obtaining bounds for dense instances of the same quality is out of reach for solvers using integer linear programming techniques.

翻译：给定图顶点的一个线性排序，顶点$v$相对于该排序的割宽是指从排序中位于$v$之前（含$v$）的任意顶点到位于$v$之后的任意顶点之间的边数。一个排序的割宽是该排序下任意顶点割宽的最大值。我们关注于寻找图的割宽，即所有排序中割宽的最小值，这是一个NP难问题。为了逼近给定图的割宽，我们提出了一种半定规划松弛方法。我们识别了若干类用于加强该半定规划松弛的有效不等式与等式约束。这些类别一方面包括众所周知的三向环方程和三角不等式，另一方面我们则从平方线性排序多胞形出发，并通过提升线性排序多胞形得到不等式。该半定规划的解可用于获得下界，同时也可用于构造可行解从而得到割宽的上界。为了评估所得边界的质量，我们在不同规模和密度的图上进行了数值实验。结果表明，我们能在合理时间内为中等规模图生成高质量的边界，且其质量与图的密度无关。相比之下，使用整数线性规划技术的求解器难以对具有相同质量的稠密实例获得可比拟的边界。