Please use this identifier to cite or link to this item:
Title: Automatic integer programming reformulation using variable neighborhood search.
Authors: Brito, Samuel Souza
Santos, Haroldo Gambini
Keywords: Integer programs
Separation problems
Chvatal-Gomory cuts
Issue Date: 2017
Citation: BRITO, S. S.; SANTOS, H. G. Automatic integer programming reformulation using variable neighborhood search. Electronic Notes in Discrete Mathematics, v. 58, p. 7-14, 2017. Disponível em: <>. Acesso em: 02 out. 2017.
Abstract: Chvatal-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.
ISSN: 15710653
Appears in Collections:DECSI - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_AutomaticIntegerProgramming.pdf217,79 kBAdobe PDFView/Open    Request a copy

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