Backdoor branching

DOI10.1007/978-3-642-20807-2_15MaRDI QIDQ3009762zbMATH OpenOpenAlexFDO

Authors 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)

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
• How important are branching decisions: fooling MIP solvers
• Local branching
• Cloud branching

Cites work

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

Cited in

(12)

• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• How important are branching decisions: fooling MIP solvers
• Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
• Learning pseudo-backdoors for mixed integer programs
• On learning and branching: a survey
• Improving strong branching by domain propagation
• DASH: dynamic approach for switching heuristics
• Branching on nonchimerical fractionalities
• Multi-task representation learning for mixed integer linear programming
• Last fifty years of integer linear programming: a focus on recent practical advances
• A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
• Restrict-and-relax search for 0-1 mixed-integer programs

Describes a project that uses

Uses Software

• CPLEX
• SCIP
• MIPLIB

This page was built for publication: Backdoor branching

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