International audienceIn this survey we discuss different state-of-the-art approaches of combining exact algorithms and metaheuristics to solve combinatorial optimization problems. Some of these hybrids mainly aim at providing optimal solutions in shorter time, while others primarily focus on getting better heuristic solutions. The two main categories in which we divide the approaches are collaborative versus integrative combinations. We further classify the different techniques in a hierarchical way. Altogether, the surveyed work on combinations of exact algorithms and metaheuristics documents the usefulness and strong potential of this research direction
There are several approaches for solving hard optimization problems. Mathematical programming techni...
We present the main results in the author’s Ph.D. thesis (Iori 2004), defended at the University of ...
In recent years, there have been significant advances in the theory and application of meta-heuristi...
International audienceIn this survey we discuss different state-of-the-art approaches of combining e...
Abstract. In this survey we discuss different state-of-the-art approaches of combining exact algorit...
International audienceResearch in metaheuristics for combinatorial optimization problems has lately ...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
Many real-world optimization problems can be modelled as combinatorial optimization problems. Often,...
Many real-world optimization problems can be modelled as combinatorial optimization problems. Often,...
We overview metaheuristics, applied to Combinatorial Optimization (CO) problems, and survey the most...
Summary. Several different ways exist for approaching hard optimization prob-lems. Mathematical prog...
The combination of exact and heuristic methods is as old as mathematical programming (MP) itself, be...
The use of meta-heuristics for solving combinatorial optimisation has now a long history, and there ...
There are several approaches for solving hard optimization problems. Mathematical programming techni...
We present the main results in the author’s Ph.D. thesis (Iori 2004), defended at the University of ...
In recent years, there have been significant advances in the theory and application of meta-heuristi...
International audienceIn this survey we discuss different state-of-the-art approaches of combining e...
Abstract. In this survey we discuss different state-of-the-art approaches of combining exact algorit...
International audienceResearch in metaheuristics for combinatorial optimization problems has lately ...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
Many real-world optimization problems can be modelled as combinatorial optimization problems. Often,...
Many real-world optimization problems can be modelled as combinatorial optimization problems. Often,...
We overview metaheuristics, applied to Combinatorial Optimization (CO) problems, and survey the most...
Summary. Several different ways exist for approaching hard optimization prob-lems. Mathematical prog...
The combination of exact and heuristic methods is as old as mathematical programming (MP) itself, be...
The use of meta-heuristics for solving combinatorial optimisation has now a long history, and there ...
There are several approaches for solving hard optimization problems. Mathematical programming techni...
We present the main results in the author’s Ph.D. thesis (Iori 2004), defended at the University of ...
In recent years, there have been significant advances in the theory and application of meta-heuristi...