Combinatorial optimization

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, …
Cite 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 …
Cite DOI
Metaheuristic algorithms for the induced p-median problem with upgrades
Facility location problems (FLPs) are a family of optimisation problems with significant social impact. This class of problems has been …
Cite DOI