How important are branching decisions: fooling MIP solvers
type: Item
instance of: scholarly article
title: How important are branching decisions: fooling MIP solvers
zbMATH Open document ID: 1408.90199
author: Pierre Le Bodic
author: G. L. Nemhauser
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6945354
zbMATH Keywords: mixed integer programming solvers
zbMATH Keywords: branch and bound
zbMATH Keywords: tree size
zbMATH Keywords: edge coloring
zbMATH Keywords: chromatic index
MaRDI profile type: Publication
full work available at URL: j.orl.2015.03.003
OpenAlex ID: W1997797794
cites work: Conflict analysis in mixed integer programming
cites work: Q5241193
cites work: 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
cites work: Branching rules revisited
cites work: Backdoors to Combinatorial Optimization: Feasibility and Optimality
cites work: Q5286666
cites work: The NP-Completeness of Edge-Coloring
cites work: Trivial integer programs unsolvable by branch-and-bound
cites work: A comparison of two edge-coloring formulations
cites work: Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
cites work: On the complexity of choosing the branching literal in DPLL
cites work: A polyhedral approach to edge coloring
cites work: How good are branching rules in DPLL?
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Q4382863
cites work: 4-edge-coloring graphs of maximum degree 3 in linear time
DOI: 10.1016/J.ORL.2015.03.003
description: scientific article; zbMATH DE number 6945354