SelfSplit parallelization for mixed-integer linear programming.

•SelfSplit an easy-to-implement way to parallelize a sequential tree-search code.•SelfSplit is deterministic and requires (almost) no communication among workers.•We investigate the performance of SelfSplit when applied to a MILP solver.•Both ad-hoc and general purpose MILP solvers are considered.•Computational results show that good speedups can be achieved in the MILP context.