## Advances in Polyhedral Relaxations of the Quadratic Linear Ordering Problem

We report on results concerning the polyhedral structure of the quadratic linear ordering problem and its associated integer linear programming formulations. Specifically, we provide a deeper analysis of the characteristic equation system that partly describes the corresponding polytope, i.e., the convex hull of the feasible solutions to the quadratic linear ordering problem, and determine an … Read more