Gurobi Solves the Previously Unsolvable

Januar 1, 2012

Gurobi Solves the Hardest Models

Gurobi solves 11 previously unsolvable, by any competitor, optimization models in the MIPLIB 2010 challenge set.

In January 2012 Gurobi was tested against the MIPLIB 2010 Challenge Set and solved 11 models previously unsolved by any commercial or academic code.

The models crossed a wide range of application domains including: lot sizing, gas network transport, mining, satellite scheduling, p-median problem, and the weighted n-queens problem. More details are available at:

This is yet another indication of the scalability of the Gurobi algorithms, the fact that Gurobi performance is often best on the most difficult models.

To learn more about how Gurobi can help you solve your most important problems we invite you to contact our Sales consultants either at or by calling +1 713 871 9341.