Preprocessing and cutting planes with conflict graphs.

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:18:27Z-
Data de disponibilização: dc.date.available2025-08-21T15:18:27Z-
Data de envio: dc.date.issued2022-02-07-
Data de envio: dc.date.issued2022-02-07-
Data de envio: dc.date.issued2020-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/jspui/handle/123456789/14461-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/abs/pii/S0305054820302938?dgcid=rss_sd_all#!-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.cor.2020.105176-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1009852-
Descrição: dc.descriptionThis paper addresses the development of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: ð Þi an efficient infrastructure for the construction and manipulation of conflict graphs; ð Þii a preprocessing routine based on a clique strengthening scheme that can both reduce the number of constraints and produce stronger formulations; ð Þ iii a clique cut separator capable of obtaining dual bounds at the root node LP relaxation that are 19:65% stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 3:62 times better than those attained by the clique cut separator of the GLPK solver and 4:22 times stronger than the dual bounds obtained by the clique separation routine of the COIN-OR Cut Generation Library; and ð Þ iv an odd-cycle cut separator with a new lifting module to produce valid odd-wheel inequalities. The average gap closed by this new version of CBC was up to four times better than its previous version. Moreover, the number of mixed-integer programs solved by CBC in a time limit of three hours was increased by 23:53%.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectMixed-integer linear programming-
Palavras-chave: dc.subjectClique inequalities-
Palavras-chave: dc.subjectOdd-cycle inequalities-
Título: dc.titlePreprocessing and cutting planes with conflict graphs.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.