How important are branching decisions: fooling MIP solvers

DOI10.1016/J.ORL.2015.03.003MaRDI QIDQ1785358zbMATH OpenOpenAlexFDO

Authors Pierre Le Bodic, G. L. Nemhauser

Publication date 28 September 2018

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2015.03.003

zbMATH Keywords

branch and boundedge coloringchromatic indextree sizemixed integer programming solvers

Mathematics Subject Classification ID

Mixed integer programming (90C11) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Further results on an abstract model for branching and its application to mixed integer programming
• An abstract model for branching and its application to mixed integer programming
• Branching on nonchimerical fractionalities
• Backdoor branching
• Cloud branching

Cites work

• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• scientific article; zbMATH DE number 227006 (Why is no real title available?)
• 4-edge-coloring graphs of maximum degree 3 in linear time
• A comparison of two edge-coloring formulations
• A polyhedral approach to edge coloring
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• Branching rules revisited
• Conflict analysis in mixed integer programming
• How good are branching rules in DPLL?
• Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 6th international conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27--31, 2009. Proceedings
• On the complexity of choosing the branching literal in DPLL
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
• The NP-Completeness of Edge-Coloring
• Trivial integer programs unsolvable by branch-and-bound

Cited in

(4)

• Estimating the Size of Branch-and-Bound Trees
• Further results on an abstract model for branching and its application to mixed integer programming
• Decomposition Branching for Mixed Integer Programming
• Backdoor branching

This page was built for publication: How important are branching decisions: fooling MIP solvers

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