Automatic integer programming reformulation using variable neighborhood search

DOI10.1016/J.ENDM.2017.03.002MaRDI QIDQ1687624zbMATH OpenOpenAlexFDO

Authors Samuel Souza Brito, Haroldo G. Santos

Publication date 4 January 2018

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

zbMATH Keywords

Chvàtal-Gomory cutsinteger programsseparation problems

Mathematics Subject Classification ID

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

Recommendations

• Lattice reformulation cuts
• Variable neighborhood search and local branching
• Projected Chvátal-Gomory cuts for mixed integer linear programs
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
• Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts

Cites work

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

Cited in

(1)

• Optimizing over the First Chvàtal Closure

Describes a project that uses

Uses Software

• MIPLIB
• MIPLIB2003

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687624)