A computational study of conflict graphs and aggressive cut separation in integer programming.
No Thumbnail Available
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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 routines found in the current version of the COmputation INfrastructure for Operations Research (COIN-OR) Branch and Cut solver.
Description
Keywords
Conflict graphs, Integer programming, Cutting planes, Cliques, Odd holes
Citation
BRITO, S. S.; SANTOS, H. G. A computational study of conflict graphs and aggressive cut separation in integer programming. Electronic Notes in Discrete Mathematics, v. 50, p. 355-360, 2015. Disponível em: <http://www.sciencedirect.com/science/article/pii/S1571065315002140>. Acesso em: 07 ago. 2016.