Solving MIPs via scaling-based augmentation

We also investigate the performance of implementations of these methods, where the augmentation directions are computed by a MIP solver. It turns out that the number of required iterations is low in most cases. While scaling methods usually do not improve the performance for easier problems, in the case of hard mixed-integer optimization problems they allow to compute solutions of very good quality and are often superior.