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

DOI10.1016/J.ENDM.2015.07.059MaRDI QIDQ324843zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cliquesconflict graphscutting planesinteger programmingodd-holes

Mathematics Subject Classification ID

Integer programming (90C10)

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

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

(6)

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

Describes a project that uses

Uses Software

• COIN-OR
• MIPLIB
• 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)