Avoiding large search trees
The search tree grows if zk < zbest and we branch
So find small zbest quickly
- Use heuristics to construct good integer solutions
- Tell your solver how aggressively to apply
- Give your solver a heuristic algorithm to use; take advantage of structures
- Reduce the interval between zbest and zLP by creating a “tight” LP formulation