ABSTRACT: The parameter configuration problem consists of finding a parameter configuration that provides the most effective performance by a given algorithm. This paper addresses this problem for MILP solvers through a new multi-phase tuner based on the iterated local search metaheuristic. The goal is to find near-optimal, if not optimal, configuration(s) for efficiently solving large-scale industrial optimization problems. Instead of tuning in the entire configuration space induced by the set of parameters, the proposed tuner focuses on a small pool of parameters that is enhanced dynamically with new promising ones. Furthermore, it uses statistical learning to benefit from the dynamically accumulated information to forbid less promising p...
Algorithms for solving hard optimization problems usually have a number of parameters that greatly i...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
Metaheuristics are an approximate method widely used to solve many hard optimization problems in a m...
Mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings th...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their pe...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
Abstract. State-of-the-art algorithms for hard computational problems often ex-pose many parameters ...
This paper addresses the problem of tuning parameters of mathematical solvers to increase their perf...
The importance of balance between exploration and exploitation plays a crucial role while solving co...
Compositional Optimization (CompOpt) was recently proposed for optimization of discrete-event system...
We propose a methodology, based on machine learning and optimization, for selecting a solver configu...
We discuss the issue of finding a good mathematical programming solver configuration for a particula...
International audienceAutomatic algorithm configuration is concerned with finding the best hyper-par...
Algorithms for solving hard optimization problems usually have a number of parameters that greatly i...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
Metaheuristics are an approximate method widely used to solve many hard optimization problems in a m...
Mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings th...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their pe...
International audienceWe propose a methodology, based on machine learning and optimization, for sele...
Abstract. State-of-the-art algorithms for hard computational problems often ex-pose many parameters ...
This paper addresses the problem of tuning parameters of mathematical solvers to increase their perf...
The importance of balance between exploration and exploitation plays a crucial role while solving co...
Compositional Optimization (CompOpt) was recently proposed for optimization of discrete-event system...
We propose a methodology, based on machine learning and optimization, for selecting a solver configu...
We discuss the issue of finding a good mathematical programming solver configuration for a particula...
International audienceAutomatic algorithm configuration is concerned with finding the best hyper-par...
Algorithms for solving hard optimization problems usually have a number of parameters that greatly i...
The best-performing algorithms for many hard problems are highly parameterized. Selecting the best h...
Metaheuristics are an approximate method widely used to solve many hard optimization problems in a m...