A computational study of conflict graphs and aggressive cut separation in integer programming.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorBrito, Samuel Souza-
Autor(es): dc.creatorSantos, Haroldo Gambini-
Data de aceite: dc.date.accessioned2025-08-21T15:31:20Z-
Data de disponibilização: dc.date.available2025-08-21T15:31:20Z-
Data de envio: dc.date.issued2016-09-05-
Data de envio: dc.date.issued2016-09-05-
Data de envio: dc.date.issued2015-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/6973-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.endm.2015.07.059-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1017332-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsaberto-
Direitos: dc.rightsO 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.-
Palavras-chave: dc.subjectConflict graphs-
Palavras-chave: dc.subjectInteger programming-
Palavras-chave: dc.subjectCutting planes-
Palavras-chave: dc.subjectCliques-
Palavras-chave: dc.subjectOdd holes-
Título: dc.titleA computational study of conflict graphs and aggressive cut separation in integer programming.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.