Sven Mallach 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
We present a family of integer programming formulations for the maximum cut problem. These formulations encode the incidence vectors of the cuts of a connected graph by employing a subset of the odd-cycle inequalities that relate to a spanning tree, and they require only the corresponding edge variables to be integral explicitly. They so describe … Read more
The computational performance of inductive linearizations for binary quadratic programs in combination with a mixed-integer programming solver is investigated for several combinatorial optimization problems and established benchmark instances. Apparently, a few of these are solved to optimality for the first time. Citationpreprint (no internal series / number): University of Bonn, Germany June 11, 2021ArticleDownload View … Read more