Constructive-destructive heuristics for the safe set problem

DOI10.1016/j.cor.2023.106311OpenAlexW4381620440MaRDI QIDQ6047845

Pierre Hosteins, Alberto Boggio Tomasaz, Roberto Cordone

Publication date: 13 September 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106311

zbMATH Keywords

graph partitioninglarge neighbourhood searchgreedy randomized adaptive search proceduresafe set problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Safe sets and in-dominating sets in digraphs

Cites Work

• Unnamed Item
• Safe set problem on graphs
• Network majority on tree topological network
• A probabilistic heuristic for a computationally difficult set covering problem
• Safe sets in graphs: graph classes and structural parameters
• A compact mixed integer linear formulation for safe set problems
• A new formulation for the safe set problem on graphs
• First vs. best improvement: an empirical study
• Models and algorithms for the weighted safe set problem
• Multiple Comparisons Among Means
• Parameterized Complexity of Safe Set
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Constructive-destructive heuristics for the safe set problem