Home  |  Papers  |  Software  |  Licensing  |  Academic Applications  |  Competitions  |  Industrial Applications  |  Speedups Achieved 

ParamILS is a state-of-the-art method for parameter tuning and algorithm configuration.
It has been used in dozens of academic applications to improve state-of-the-art solvers for more then ten hard computational problems (see its 250+ Google scholar citations). ParamILS has also had an impact in several industrial applications. In all these applications, ParamILS has yielded substantial speedups of state-of-the-art solvers for hard combinatorial problems, such as propositional satisfiability (SAT), mixed integer programming (MIP), AI planning, answer set programing (ASP), and timetabling. By doing so, ParamILS has helped several systems win solver competitions.

Latest News

July 12, 2013: ParamILS was one of the key algorithm configuration procedures to enable the Configurable SAT Solver Competition (CSSC), achieving orders of magnitude speedups of several SAT solvers on several domains.

October 10, 2012: For the fifth term running, the exams of UBC's 40.000 students have been scheduled with a timetabler optimized with ParamILS. An early version of the solver was described by Fawcett et al., [2009].

View previous news.



Below we list the papers directly pertaining to the ParamILS method. Dozens of papers applying ParamILS to optimize various solvers are listed on the Applications page.




ParamILS is free for academic use. If you would like to use ParamILS in a commercial product please contact us about licensing options.

Please send any questions, concerns or comments to Frank Hutter or Chris Fawcett