Automatic integer programming reformulation using variable neighborhood search.

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:06:30Z-
Data de disponibilização: dc.date.available2025-08-21T15:06:30Z-
Data de envio: dc.date.issued2018-01-18-
Data de envio: dc.date.issued2018-01-18-
Data de envio: dc.date.issued2017-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/9270-
Fonte completa do material: dc.identifierhttp://www.sciencedirect.com/science/article/pii/S1571065317300380-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.endm.2017.03.002-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1002552-
Descrição: dc.descriptionChvatal-Gomory cuts are well-known cutting planes for Integer Programming problems. As shown in previous works, the inclusion of these cuts allows to significantly reducing the integrality gap. This work presents a Local Search heuristic approach based on Variable Neighborhood Search to discover violated Chv`atal-Gomory inequalities. Since this problem is known to be NP-hard, this approach was designed to generate violated inequalities in restricted amounts of time. Constraints are grouped in several sets, considering the amount of common variables. These sets are processed in parallel in order to obtain the best multipliers and produce violated cuts. We report some preliminary results obtained for MIPLIB 3.0 and 2003 instance sets, comparing our approach with an integer programming based separation method. Our algorithm was able to separate many violated inequalities, reducing the duality gap. Furthermore, it uses an extended numerical precision implementation, since it is not specifically bound to simplex based solvers.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectInteger programs-
Palavras-chave: dc.subjectSeparation problems-
Palavras-chave: dc.subjectChvatal-Gomory cuts-
Título: dc.titleAutomatic integer programming reformulation using variable neighborhood search.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.