Automatic integer programming reformulation using variable neighborhood search
| Autor: | Samuel Souza Brito, Haroldo Gambini Santos |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Mathematical optimization
021103 operations research Simplex Duality gap Heuristic (computer science) business.industry Applied Mathematics 0211 other engineering and technologies 0102 computer and information sciences 02 engineering and technology 01 natural sciences Numerical precision 010201 computation theory & mathematics Discrete Mathematics and Combinatorics Separation method Local search (optimization) business Integer programming Variable neighborhood search Mathematics |
| Zdroj: | Electronic Notes in Discrete Mathematics. 58:7-14 |
| ISSN: | 1571-0653 |
| DOI: | 10.1016/j.endm.2017.03.002 |
| Popis: | 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 Chvatal-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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect