State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study the application of an automated algorithm configuration procedure to different MIP solvers, instance types and optimization objectives. We show that this fully-automated process yields substantial improvements to the performance of three MIP solvers: Cplex, Gurobi, and lpsolve. Although our method can be used "out of the box" without any domain knowledge specific to MIP, we show that it outperforms the Cplex special-purpose automated tuning tool. © 2010 Springer-Verlag.
CITATION STYLE
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2010). Automated configuration of mixed integer programming solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6140 LNCS, pp. 186–202). https://doi.org/10.1007/978-3-642-13520-0_23
Mendeley helps you to discover research relevant for your work.