Well, my point is that you can encode the tricks described in the linked article directly in a modern MILP solver in a way that is legible to the solver. We'd expect similar behaviour in that case, or perhaps slightly better, because the solver can 'see' them better.
Yes, if you do a naive programme only, it would be a massive search space.
Yes, if you do a naive programme only, it would be a massive search space.