A computational study of conflict graphs and aggressive cut separation in integer programming

DOI10.1016/J.ENDM.2015.07.059zbMath1356.90085OpenAlexW2221603147MaRDI QIDQ324843

Samuel Souza Brito, Marcus Poggi, Haroldo Gambini Santos

Publication date: 17 October 2016

Full work available at URL: http://www.repositorio.ufop.br/handle/123456789/6973

zbMATH Keywords

integer programmingcutting planescliquesconflict graphsodd-holes

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Automatic integer programming reformulation using variable neighborhood search ⋮ General cut-generating procedures for the stable set polytope ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes

Uses Software

• MIPLIB
• COIN-OR
• Algorithm 457

Cites Work

• Conflict graphs in solving integer programming problems
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: A computational study of conflict graphs and aggressive cut separation in integer programming