Metaheuristics

Double Roman Domination Problem: An iterated local search approach
In the last few decades, graph domination problems have attracted the attention of both academics and practitioners. In these problems, …
Citar DOI
Large Language Models for Metaheuristic Implementation: A Case Study with Variable Neighborhood Search
Metaheuristics are widely used in combinatorial optimization to address large-scale problems but often require considerable expertise …
Citar DOI
Empirical Complexity Analysis of Optimization Algorithms
Modern solvers for combinatorial optimization problems are often the result of hybridizing several algorithmic techniques. Algorithmic …
Citar DOI URL