Linear Programming methods (barrier/simplex) have been able to run faster and solve larger instances in great part due to algorithmic advances (the other contribution being faster hardware, more memory etc). Considering that LP is a fundamental tool for mixed/integer programming, these improvements are incredibly valuable.

Gurobi had a white paper mentioning how much their solvers' performance was improved by which techniques (I'll link it here if I can find it).