Automatic integer programming reformulation using variable neighborhood search

DOI10.1016/J.ENDM.2017.03.002zbMath1388.90089OpenAlexW2607139042MaRDI QIDQ1687624

Samuel Souza Brito, Haroldo Gambini Santos

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.002

zbMATH Keywords

integer programsseparation problemsChvàtal-Gomory cuts

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• MIPLIB
• MIPLIB2003

Cites Work

• A computational study of conflict graphs and aggressive cut separation in integer programming
• Optimizing over the first Chvátal closure
• Variable neighborhood search
• MIPLIB 2003

This page was built for publication: Automatic integer programming reformulation using variable neighborhood search