2

A scalable GRASP algorithm for the targeted misinformation blocking problem
The research on Social Network Analysis has exponentially grown in the last decades due to the relevance of social networks in the …
Cite DOI
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
Mathematical formulation and heuristic methods for the Min--Max Sitting Arrangement Problem in the Cycle
The Cyclic Min–Max Sitting Arrangement (CMMSA) is an NP-hard problem which seeks to embed the vertices of a signed input graph, …
Cite DOI URL
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
Scheduling Long-Distance Transport Operations under Labor Regulations: A Hybrid Optimization Approach
This work solves a case study of a transportation company that aims to plan the maximum number of jobs requested by customers that must …
Cite DOI
A Case Study of a Transportation Company Modeled as a Scheduling Problem
This case study tackles a real-world problem of a transportation company that is modeled as a scheduling optimization problem. The main …
Cite DOI URL
Determining good solutions and validating them with a metaheuristic approach in social network influence minimization problems
The evolution of social networks has given rise to significant challenges associated with the overwhelming amount of information …
Cite DOI URL
A multistart variable neighborhood descent metaheuristic for the board packing problem
The Board Packing Problem (BoPP) considers a rectangular board divided in cells with m rows and n columns. In this problem, a subset …
Cite DOI URL
Efficient heuristics for the obnoxious planar p-median problem with variable sizes
One of the most common problems in locating obnoxious facilities is the obnoxious p-median problem. This problem seeks to maximize the …
Cite DOI URL
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious …
Cite DOI URL