Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/6973
Title: A computational study of conflict graphs and aggressive cut separation in integer programming.
Authors: Brito, Samuel Souza
Santos, Haroldo Gambini
Keywords: Conflict graphs
Integer programming
Cutting planes
Cliques
Odd holes
Issue Date: 2015
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.
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.
URI: http://www.repositorio.ufop.br/handle/123456789/6973
ISSN: 15710653
metadata.dc.rights.license: O Periódico Electronic Notes in Discrete Mathematics concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3926560831204
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_ComputacionalStudyConflit.pdf198,89 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.