Information-Theoretic Approaches to Branching in Search

@article{Gilpin2006InformationTheoreticAT,
  title={Information-Theoretic Approaches to Branching in Search},
  author={Andrew Gilpin and Tuomas Sandholm},
  journal={Discrete Optimization},
  year={2006},
  volume={8},
  pages={147-159}
}
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all information-theoretically motivated to reduce uncertainty in remaining subproblems. In the first family, a good variable to branch on is selected based on lookahead. In real-world procurement optimization, this entropic branching method outperforms default CPLEX and strong branching. The second family combines this idea with… CONTINUE READING