Peres, F., & Castelli, M. (2021). Combinatorial optimization problems and metaheuristics: Review, challenges, design, and development. Applied Sciences (Switzerland), 11(14), 1-39. [6449]. https://doi.org/10.3390/app11146449In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in an increased interest in this research field. Nevertheless, new studies have been focused on developing new algorithms without providing consolidation of the existing knowledge. Furthermore, the absence of rigor and formalism to classify, design, and develop combinatorial...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to o...
A metaheuristic is a collection of algorithmic concepts that can be used to define heuristic methods...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathemati...
Ce document présente certaines voies prometteuses, émergent actuellement dans le domaine de l\u27opt...
Following decades of sustained improvement, metaheuristics are one of the great success stories of o...
Dissertation presented as the partial requirement for obtaining a Master's degree in Data Science a...
We overview metaheuristics, applied to Combinatorial Optimization (CO) problems, and survey the most...
In recent years, there have been significant advances in the theory and application of meta-heuristi...
Following decades of sustained improvement, metaheuristics are one of the great success stories of o...
This talk provides a complete background on metaheuristics and presents in a unified view the main d...
Many problems arising in several and different areas of human knowledge share the characteristic of ...
Combinatorial optimization problems arise, in many forms, in vari- ous aspects of everyday life. Now...
Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex ...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to o...
A metaheuristic is a collection of algorithmic concepts that can be used to define heuristic methods...
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex pr...
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathemati...
Ce document présente certaines voies prometteuses, émergent actuellement dans le domaine de l\u27opt...
Following decades of sustained improvement, metaheuristics are one of the great success stories of o...
Dissertation presented as the partial requirement for obtaining a Master's degree in Data Science a...
We overview metaheuristics, applied to Combinatorial Optimization (CO) problems, and survey the most...
In recent years, there have been significant advances in the theory and application of meta-heuristi...
Following decades of sustained improvement, metaheuristics are one of the great success stories of o...
This talk provides a complete background on metaheuristics and presents in a unified view the main d...
Many problems arising in several and different areas of human knowledge share the characteristic of ...
Combinatorial optimization problems arise, in many forms, in vari- ous aspects of everyday life. Now...
Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex ...
Meta-heuristic algorithm development through a novel intergrated problem solving environment for so...
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to o...
A metaheuristic is a collection of algorithmic concepts that can be used to define heuristic methods...