DASH: Dynamic Approach for Switching Heuristics.

•We introduce a learning framework for solving general mixed-integer problems (MIP).•We analyze the tree-search and visualize the evolution of the problem structure.•MIP instances gradually change structure as branching heuristics are applied.•Tracing the sub-problems during search allows dynamic heuristic selection.•Switching heuristics can improve the standard pure MIP branching.