Backdoor Branching

DOI10.1007/978-3-642-20807-2_15zbMath1341.90091OpenAlexW2912393568MaRDI QIDQ3009762

Matteo Fischetti, Michele Monaci

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_15

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems ⋮ DASH: dynamic approach for switching heuristics ⋮ Learning pseudo-backdoors for mixed integer programs ⋮ On learning and branching: a survey ⋮ Branching on nonchimerical fractionalities ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Improving strong branching by domain propagation ⋮ Restrict-and-relax search for 0-1 mixed-integer programs

Uses Software

• SCIP
• MIPLIB
• CPLEX

Cites Work

• Resolution search
• Information-based branching schemes for binary linear mixed integer problems
• Gomory cuts revisited
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• Experiments in mixed-integer linear programming