Modified strong branching scores that cap estimated LP gains at the primal-dual gap and re-weight branches based on leaf asymmetry reduce branch-and-bound tree sizes on MIPLIB 2017 instances.
A machine learning-based approximation of strong branching.INFORMS Journal on Computing, 29(1):185–195, 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Improving Full Strong Branching Decisions by Incorporating Additional Information
Modified strong branching scores that cap estimated LP gains at the primal-dual gap and re-weight branches based on leaf asymmetry reduce branch-and-bound tree sizes on MIPLIB 2017 instances.