Jesús Sánchez-Oro
Jesús Sánchez-Oro
Home
Publications
Projects
Contact
Light
Dark
Automatic
A fast metaheuristic for finding the minimum dominating set in graphs
A. Casado
,
S. Bermudo
,
A.D. López-Sánchez
,
J. Sánchez-Oro
January 2022
PDF
Cite
Type
Conference paper
Publication
14th Metaheuristics International Conference
Related
An iterated greedy algorithm for finding the minimum dominating set in graphs
The Bi-objective p-Center and p-Dispersion problem
A Multi-Objective Parallel Iterated Greedy for Solving the p-Center and p-Dispersion Problem
GRASP and VNS for solving the p-next center problem
A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
Cite
×