What are the advantages of using the generic callback compared to the old user/lazy callbacks within a branch-and-cut framework?
IBM states on its website that the major benefit of the new generic callback is that it allows for dynamic search strategies. However, most researchers still solve their MIPs with a branch-and-cut framework and then this dynamic search is not possible anyway (correct me if I am wrong). On top of that, the new callback provides a lower degree of control on the branch-and-bound/branch-and-cut process. IBM rightly states that this low-level control is often not required, however for academic purposes, it is good to have some control, for instance to more fairly test the effectiveness of new valid inequalities or branching rules.
This lets me wonder whether the generic callback brings other considerable advantages besides the dynamic search strategy. And are those new features worth the effort to re-implement already working algorithms?