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

DOI10.1016/J.ENDM.2015.07.059zbMATH Open1356.90085OpenAlexW2221603147MaRDI QIDQ324843FDOQ324843

Authors: Samuel Souza Brito, Marcus Poggi, Haroldo G. Santos 

Publication date: 17 October 2016

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

Recommendations

• Preprocessing and cutting planes with conflict graphs
• Conflict graphs in solving integer programming problems
• The vertex separator problem: algorithms and computations
• Computational Integer Programming and Cutting Planes
• Conflict analysis in mixed integer programming

zbMATH Keywords

integer programmingcutting planescliquesconflict graphsodd-holes

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

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

Cited In (5)

• General cut-generating procedures for the stable set polytope
• Preprocessing and cutting planes with conflict graphs
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
• Conflict graphs in solving integer programming problems
• Automatic integer programming reformulation using variable neighborhood search

Uses Software

• MIPLIB
• COIN-OR
• Algorithm 457

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

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