How important are branching decisions: fooling MIP solvers

DOI10.1016/j.orl.2015.03.003zbMath1408.90199OpenAlexW1997797794MaRDI QIDQ1785358

Pierre Le Bodic, Nemhauser, George I.

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)

Related Items

Estimating the Size of Branch-and-Bound Trees, Decomposition Branching for Mixed Integer Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of two edge-coloring formulations
• 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
• A polyhedral approach to edge coloring
• How good are branching rules in DPLL?
• 4-edge-coloring graphs of maximum degree 3 in linear time
• Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
• Branching rules revisited
• On the complexity of choosing the branching literal in DPLL
• Conflict analysis in mixed integer programming
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• The NP-Completeness of Edge-Coloring
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Trivial integer programs unsolvable by branch-and-bound