This work explores the fast creation of densely populated conflict graphs at the root node of
the search tree for integer programs. We show that not only the Generalized Upper Bound
(GUB) constraints are useful for the fast detection of cliques: these can also be quickly
detected in less structured constraints in O (n log⁡ n). Routines for the aggressive
separation and lifting of cliques and odd-holes are proposed. Improved bounds and a faster
convergence to strong bounds were observed when comparing to the default separation …