Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrito, Samuel Souza-
dc.contributor.authorSantos, Haroldo Gambini-
dc.identifier.citationBRITO, 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: <>. Acesso em: 07 ago. 2016.pt_BR
dc.description.abstractThis 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.pt_BR
dc.subjectConflict graphspt_BR
dc.subjectInteger programmingpt_BR
dc.subjectCutting planespt_BR
dc.subjectOdd holespt_BR
dc.titleA computational study of conflict graphs and aggressive cut separation in integer programming.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.rights.licenseO 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: 3926560831204pt_BR
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.